Average path length in random networks.

By A. Fronczak, P. Fronczak, J. Hołyst. Physical review. E, Statistical, nonlinear, and soft matter physics, 2002

312 citations recorded by the source corpus.

Analytic solution for the average path length in a large class of uncorrelated random networks with hidden variables is found. We apply the approach to classical random graphs of Erdös and Rényi (ER), evolving networks introduced by Barabási and Albert as well as random networks with asymptotic scale-free connectivity distributions characterized by an arbitrary scaling exponent alpha>2. Our result for 2<alpha<3 shows that structural properties of asymptotic scale-free networks including numerous examples of real-world systems are even more intriguing than ultra-small world behavior noticed in pure scale-free structures and for large system sizes N-->infinity there is a saturation effect for the average path length.

Subfields: Computer Networks and Communications, Geometry and Topology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/0b9107b96b39a00fc18986cb6a578e301fbc00ec

Citations in the corpus

• Higher integration of the whole-brain resting state theta band network is associated with spatial working memory (2026, unknown): “A low characteristic path length is typically observed in highly integrated networks, reflecting high global efficiency (Fronczak et al., 2004).”