Correlation between weighted spectral distribution and average path length in evolving networks

DOI10.1063/1.4941727zbMath1388.05175OpenAlexW2256411278WikidataQ39956229 ScholiaQ39956229MaRDI QIDQ4563837

Ying Zhou, Rong-hua Guo, Cheng-dong Huang, Jing Du, Yuan-ping Nie, Bo Jiao, Ye-rong Tao, Xiao-Qun Wu, Jian-mai Shi

Publication date: 4 June 2018

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

Full work available at URL: https://doi.org/10.1063/1.4941727

zbMATH Keywords

synchronic random graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items

The 3-cycle weighted spectral distribution in evolving community-based networks ⋮ Graph sampling for Internet topologies using normalized Laplacian spectral features

Cites Work

• Unnamed Item
• On the spectra of general random graphs
• On the distribution of the roots of certain symmetric matrices
• Deterministic small-world networks
• Deterministic scale-free small-world networks of arbitrary order
• Emergence of Scaling in Random Networks
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Collective dynamics of ‘small-world’ networks
• Spectra of random graphs with given expected degrees
• Deterministic scale-free networks

This page was built for publication: Correlation between weighted spectral distribution and average path length in evolving networks