Physical Review E · 2008 · 59 citations · 43 references
Natural SciencesMathematicsComputer NetworksStochastic ProcessesTopologyGraph TheoryNetwork TheoryAverage Path LengthRecursionSelf-similar ProcessesSelf-similar Structures
With the help of recursion relations derived from the self-similar structure, we obtain the solution of average path length, d[over ]_(t) , for Apollonian networks. In contrast to the well-known numerical result d[over ]_{t} proportional, variant(ln N_(t));(3/4) [J. S. Andrade, Jr., Phys. Rev. Lett. 94, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmically as d[over ]_(t) proportional, variantln N_(t) in the infinite limit of network size N_(t) . The extensive numerical calculations completely agree with our closed-form solution.
43
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
Statistical mechanics of complex networks
Réka Albert, Albert-Ĺaszló Barabási · Reviews of Modern Physics · 2002 · 20.6K citations · Full text
The Structure and Function of Complex Networks
Michael Newman · SIAM Review · 2003 · 18.7K citations · Full text
Complex networks: Structure and dynamics
Stefano Boccaletti, Vito Latora, Yamir Moreno et al. · Physics Reports · 2006 · 11K citations