Self Organized Scale-Free Networks from Merging and Regeneration

Abstract

We consider the self organizing process of merging and regeneration of vertices in complex networks and demonstrate that a scale-free degree distribution emerges in a steady state of such a dynamics. The merging of neighbor vertices in a network may be viewed as an optimization of efficiency by minimizing redundancy. It is also a mechanism to shorten the distance and thus decrease signaling times between vertices in a complex network. Thus the merging process will in particular be relevant for networks where these issues related to global signaling are of concern.

References in corpus (2)

• Scale free networks from a Hamiltonian dynamics
• Self-organization of structures and networks from merging and small-scale fluctuations

Cited by in corpus (7)

• Emergent self-organized complex network topology out of stability constraints
• Unified model for network dynamics exhibiting nonextensive statistics
• Models and average properties of scale-free directed networks
• Scale-free networks with a large- to hypersmall-world transition
• Optimization and Scale-freeness for Complex Networks
• What do we learn from correlations of local and global network properties?
• Higher-order distributions and nongrowing complex networks without multiple connections