Self-Organization Induced Scale-Free Networks

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 ad...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Yan, Gang, Zhou, Tao, Ying-Di, Jin, Zhong-Qian, Fu
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 28.08.2004
Subjects
Clustering
Complex systems
Computer simulation
Social networks
Online AccessGet full text

Cover

More Information
Summary: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\'{a}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.
ISSN:2331-8422