Self organized scale-free networks from merging and regeneration

2004/03/05 by Beom Jun Kim, B. J. Kim, A. Trusina +5 · 47 citations
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Key (lock) #Neural Networks and Applications #Node (physics) #Process (computing) #Scale (ratio) #State (computer science) #Theoretical and Computational Physics #cond-mat.dis-nn #nlin.AO

paper · pdf · doi:10.1140/epjb/e2005-00065-y

published in The European Physical Journal B 43(3), 369-372 (Springer Science+Business Media)

arxiv created 2004/03/05 · openalex publication_date 2005/02/01 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

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.

Citations

• Dynamical and Correlation Properties of the Internet
• Emergence of scaling in random networks
• Scale-free networks from a Hamiltonian dynamics
• The large-scale organization of metabolic networks
• On power-law relationships of the Internet topology

Cited by

• Unified model for network dynamics exhibiting nonextensive statistics
• Scale-free networks with a large- to hypersmall-world transition