Analysis of average shortest-path length of scale-free network
DOI10.1155/2013/865643zbMATH Open1271.68107OpenAlexW2004699076WikidataQ59004973 ScholiaQ59004973MaRDI QIDQ364556FDOQ364556
Authors: Guoyong Mao, Ning Zhang 
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/865643
Recommendations
- A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network
- Ultra-fast load balancing on scale-free networks
- The average path length of scale free networks
- Parallelism in simulation and modeling of scale-free complex networks
- scientific article; zbMATH DE number 1863286
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Statistical mechanics of complex networks
- A note on two problems in connexion with graphs
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Collective dynamics of `small-world' networks
- Title not available (Why is that?)
- A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Cited In (5)
- THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
- A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network
- The average path length of scale free networks
- Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- NETAL: high-performance implementation of network analysis library considering computer memory hierarchy
Uses Software
This page was built for publication: Analysis of average shortest-path length of scale-free network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364556)
