Abstract
Universal scaling of distances between vertices of Erdős-Rényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A mean distance between two nodes of degrees and equals to . The scaling is valid over several decades. A simple theory for the appearance of this scaling is presented. Parameters and depend on the mean value of a node degree calculated for the nearest neighbors and on network clustering coefficients.
- Received 5 November 2004
DOI:https://doi.org/10.1103/PhysRevE.72.026108
©2005 American Physical Society