A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network

DOI10.1155/2014/154172zbMath1437.90156DBLPjournals/jam/MaoZ14OpenAlexW2004106970WikidataQ59049990 ScholiaQ59049990MaRDI QIDQ2336171

Ning Zhang, Guoyong Mao

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/154172

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• A note on two problems in connexion with graphs
• Analysis of average shortest-path length of scale-free network
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network