Distinct Clusterings and Characteristic Path Lengths in Dynamic Small-World Networks with Identical Limit Degree Distribution
- 208 Downloads
Many real-world networks belong to a particular class of structures, known as small-world networks, that display short distance between pair of nodes. In this paper, we introduce a simple family of growing small-world networks where both addition and deletion of edges are possible. By tuning the deletion probability q t , the model undergoes a transition from large worlds to small worlds. By making use of analytical or numerical means we determine the degree distribution, clustering coefficient and average path length of our networks. Surprisingly, we find that two similar evolving mechanisms, which provide identical degree distribution under a reciprocal scaling as t goes to infinity, can lead to quite different clustering behaviors and characteristic path lengths. It is also worth noting that Farey graphs constitute the extreme case q t ≡0 of our random construction.
KeywordsDegree distribution Small world graph Complex network
The author would like to thank the referees for the valuable suggestions and comments.
- 25.Sandberg, O., Clarke, I.: The Evolution of Navigable Small-World Networks. arXiv:cs/0607025 (2006)
- 27.Shang, Y.: Exponential random geometric graph process models for mobile wireless networks. In: Proc. of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, Zhangjiajie, pp. 56–61 (2009) Google Scholar
- 34.Wang, J., Rong, L.: Evolving small-world networks based on the modified BA model. In: Proc. International Conference on Computer Science and Information Technology, pp. 143–146 (2008) Google Scholar
- 35.Watts, D.J.: Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, New Jersey (1999) Google Scholar