ID: cond-mat/0405076

Growing Networks with Enhanced Resilience to Perturbation

May 5, 2004

View on ArXiv
Markus Brede, John Finnigan
Condensed Matter
Disordered Systems and Neura...
Statistical Mechanics

Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In this letter we propose a new mechanism for the construction of SF networks: Evolving networks as interaction networks of systems which are distinguished by their stability if perturbed out of equilibrium. Stability is measured by the largest real part of any eigenvalue of a matrix associated with the graph. We extend the model to weighted directed networks and report power law behaviour of the link strength distribution of the weighted graphs in the SF regime. The model we propose for the first time relates SF networks to stability properties of the underlying dynamical system.

Similar papers 1

Evolution of networks

June 8, 2001

92% Match
S. N. Dorogovtsev, J. F. F. Mendes
Statistical Mechanics

We review the recent fast progress in statistical physics of evolving networks. Interest has focused mainly on the structural properties of random complex networks in communications, biology, social sciences and economics. A number of giant artificial networks of such a kind came into existence recently. This opens a wide field for the study of their topology, evolution, and complex processes occurring in them. Such networks possess a rich set of scaling properties. A number ...

Find SimilarView on arXiv

Emergent self-organized complex network topology out of stability constraints

September 26, 2008

91% Match
J. I. Perotti, O. V. Billoni, F. A. Tamarit, ... , Cannas S. A.
Disordered Systems and Neura...
Physics and Society
Populations and Evolution

Although most networks in nature exhibit complex topology the origins of such complexity remains unclear. We introduce a model of a growing network of interacting agents in which each new agent's membership to the network is determined by the agent's effect on the network's global stability. It is shown that out of this stability constraint, scale free networks emerges in a self organized manner, offering an explanation for the ubiquity of complex topological properties obser...

Find SimilarView on arXiv

Structure and dynamical behaviour of non-normal networks

March 30, 2018

91% Match
Malbor Asllani, Renaud Lambiotte, Timoteo Carletti
Adaptation and Self-Organizi...

We analyse a collection of empirical networks in a wide spectrum of disciplines and show that strong non-normality is ubiquitous in network science. Dynamical processes evolving on non-normal networks exhibit a peculiar behaviour, as initial small disturbances may undergo a transient phase and be strongly amplified in linearly stable systems. Additionally, eigenvalues may become extremely sensible to noise, and have a diminished physical meaning. We identify structural proper...

Find SimilarView on arXiv

Modeling the evolution of weighted networks

June 10, 2004

91% Match
Alain Barrat, Marc Barthelemy, Alessandro Vespignani
Statistical Mechanics

We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement mechanism coupled to the local network growth. That coupling can be generalized in order to include the effect of additional randomness and non-linearities which can be present in real-world networks. The model generates weighted graphs exhibiting ...

Find SimilarView on arXiv

Weighted evolving networks: coupling topology and weights dynamics

January 6, 2004

90% Match
Alain Barrat, Marc Barthelemy, Alessandro Vespignani
Disordered Systems and Neura...
Statistical Mechanics

We propose a model for the growth of weighted networks that couples the establishment of new edges and vertices and the weights' dynamical evolution. The model is based on a simple weight-driven dynamics and generates networks exhibiting the statistical properties observed in several real-world systems. In particular, the model yields a non-trivial time evolution of vertices' properties and scale-free behavior for the weight, strength and degree distributions.

Find SimilarView on arXiv

Complexity vs stability in small-world networks

July 24, 2004

90% Match
Sitabhra Sinha
Adaptation and Self-Organizi...

According to the May-Wigner stability theorem, increasing the complexity of a network inevitably leads to its destabilization, such that a small perturbation will be able to disrupt the entire system. One of the principal arguments against this observation is that it is valid only for random networks, and therefore does not apply to real-world networks, which presumably are structured. Here we examine how the introduction of small-world topological structure into networks aff...

Find SimilarView on arXiv

Stability of complex networks under the evolution of attack and repair

May 9, 2005

90% Match
L. P. Chi, C. B. Yang, X. Cai
Statistical Mechanics

With a simple attack and repair evolution model, we investigate and compare the stability of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to describe the stability of the system. We find that both RG and SF networks can evolve to a stationary state. The stationary value Ic has a power-law dependence on the average degree <k>_rg for RG networks; and an exponential relationship with the repai...

Find SimilarView on arXiv

Growing Scale-Free Networks with Small World Behavior

July 30, 2001

90% Match
Konstantin Klemm, Victor M. Eguiluz
Condensed Matter

In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases logartihmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive expressions for the clustering coefficient in two limiting cases: random (C ~ (ln N)^2 / N) and highly clustered (C =...

Find SimilarView on arXiv

Assortative mixing by degree makes a network more unstable

July 29, 2005

90% Match
Markus Brede, Sitabhra Sinha
Statistical Mechanics
Disordered Systems and Neura...

We investigate the role of degree correlation among nodes on the stability of complex networks, by studying spectral properties of randomly weighted matrices constructed from directed Erd\"{o}s-R\'enyi and scale-free random graph models. We focus on the behaviour of the largest real part of the eigenvalues, $\lambda_\text{max}$, that governs the growth rate of perturbations about an equilibrium (and hence, determines stability). We find that assortative mixing by degree, wher...

Find SimilarView on arXiv

Statistical mechanics of complex networks

June 6, 2001

90% Match
Reka Albert, Albert-Laszlo Barabasi
cond-mat.stat-mech
cond-mat.dis-nn
cs.NI
math.MP
nlin.AO
physics.data-an

Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks is governed by robust organizing principles. Here we review the recent advances in the f...

Find SimilarView on arXiv