Spectral densities of scale-free networks

DOI10.1063/1.2735019zbMath1159.37360arXivcond-mat/0703055OpenAlexW1978345999WikidataQ80575415 ScholiaQ80575415MaRDI QIDQ3624828

D. Kim, Byungnam Kahng

Publication date: 30 April 2009

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0703055

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (4)

SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS ⋮ Spectral properties of hypercubes with applications ⋮ Introduction: Optimization in networks ⋮ Extreme fluctuations in noisy task-completion landscapes on scale-free networks

Cites Work

• Evolution of scale-free random graphs: Potts model formulation
• Connected components in random graphs with given expected degree sequences
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Eigenvalue spectra of complex networks
• Extreme fluctuations in noisy task-completion landscapes on scale-free networks
• The spectral dimension of random trees
• Spectra of random graphs with given expected degrees
• Random incidence matrices: moments of the spectral density

This page was built for publication: Spectral densities of scale-free networks