arXiv · cond-mat/0408631
Self-Organization Induced Scale-Free Networks
Abstract
What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is introduced in this letter. At each time step, a new node is added to the network and connect to some existing nodes randomly, instead of "preferential attachment" introduced by Barabási and Albert, and then the new node will connect with its neighbors' neighbors at a fixed probability, which is natural to collaboration networks and social networks of acquaintance or other relations between individuals. The simulation results show that those networks generated from our model are scale-free networks with satisfactorily large clustering coefficient.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gang Yan, Tao Zhou, Ying-Di Jin, Zhong-Qian Fu. 2004-08-28. Self-Organization Induced Scale-Free Networks. https://arxiv.org/abs/cond-mat/0408631
Cite the original work for its findings. Save a collection to share your selection of sources.