arXiv · 0911.3454
An alternative approach to determining average distance in a class of scale-free modular networks
Abstract
Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing scale-free modular networks. By virtue of the recursive relations derived from the self-similar structure of the networks, we compute rigorously this important quantity, obtaining an explicit closed-form solution, which recovers the previous result and is corroborated by extensive numerical calculations. The obtained exact expression shows that the average distance scales logarithmically with the number of nodes in the networks, indicating an existence of small-world behavior. We present that this small-world phenomenon comes from the peculiar architecture of the network family.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zhongzhi Zhang, Yuan Lin, Shuigeng Zhou, Zhigang Wang, Jihong Guan. 2009-11-18. An alternative approach to determining average distance in a class of scale-free modular networks. https://doi.org/10.1088/1742-5468%2F2010%2F12%2Fp12017
Cite the original work for its findings. Save a collection to share your selection of sources.