Self organized scale-free networks from merging and regeneration

  title={Self organized scale-free networks from merging and regeneration},
  author={Beom Jun Kim and Ala Trusina and Petter Minnhagen and Kim Sneppen},
  journal={The European Physical Journal B - Condensed Matter and Complex Systems},
Abstract.We propose that the ubiquitous scale free nature of many real world networks may emerge from a steady state process where nodes are created and merged randomly. The merging may be viewed as an optimization of efficiency by minimizing redundancy.  
Self-Organization of Topology and Weight Dynamics on Networks from Merging and Regeneration
A model of weighted networks in which the structural evolution is coupled with weight dynamics, which gives power-law distributions of degree, strength and weight, as observed in many real networks is proposed.
Structures in complex systems : Playing dice with networks and books
Complex systems are neither perfectly regular nor completely random. They consist of a multitude of players who, in many cases, playtogether in a way that makes their combined strength greater than
Random Connection Based Scale-free Networks
Through the simulation, this model absolutely has the characteristics of scale-free networks and the power-law distribution index is shown.
Unified model for network dynamics exhibiting nonextensive statistics.
A dynamical network model which unifies a number of network families which are individually known to exhibit q-exponential degree distributions is introduced which generalizes network dynamics to rewiring and growth modes which depend on internal topology as well as on a metric imposed by the space they are embedded in.
Scale-free networks with a large- to hypersmall-world transition
Information horizons in a complex world
The whole in a complex system is the sum of its parts, plus the interactions between the parts. Understanding social, biological, and economic systems therefore often depends on understanding their
A simple phenomenological model for time evolution of social networks
A phenomenological model with the simplification of real social networks is proposed to explore the evolutionary features of these networks composed of the entities whose behaviors are dominated by two events: union and division.
Topology of resultant networks shaped by evolutionary pressure.
A model that uses several previously proposed network growth algorithms was developed to grow networks that adapt under exogenous stress and provides initial insights into distribution of pathways in naturally evolving complex systems that have defined input-output relationships.


Scale-free networks from a Hamiltonian dynamics.
  • M. Baiesi, S. S. Manna
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
This work presents a model with fixed number of nodes and links, where a dynamics favoring the formation of links between nodes with degree of connectivity as different as possible is introduced and finds nontrivial hierarchical clustering.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Scale-free networks from varying vertex intrinsic fitness.
A new mechanism leading to scale-free networks is proposed, which is called a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected).
Dynamical and correlation properties of the internet.
It is found that the Internet is characterized by non-trivial correlations among nodes and different dynamical regimes, and the importance of node hierarchy and aging in the Internet structure and growth is pointed out.
Steady-state distribution of generalized aggregation system with injection.
  • Takayasu
  • Physics
    Physical review letters
  • 1989
It is rigorously shown that the charge distribution follows a power law in the steady state which is sustained by random injection, which depends both on the type of injection and on the spatial dimension.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Specificity and Stability in Topology of Protein Networks
It is found that for both interaction and regulatory networks, links between highly connected proteins are systematically suppressed, whereas those between a highly connected and low-connected pairs of proteins are favored.
Correlated random networks.
More general interactions H(c) are studied which lead to correlations, for example, between the connectivities of adjacent vertices which are argued to be a crucial signature of evolutionary design in biological networks.
Complexity and fragility in ecological networks
  • R. Solé, M. Montoya
  • Environmental Science
    Proceedings of the Royal Society of London. Series B: Biological Sciences
  • 2001
The results suggest that ecological networks are very robust against random removals but can be extremely fragile when selective attacks are used, and have important consequences for biodiversity dynamics and conservation issues, current estimations of extinction rates and the relevance and definition of keystone species.