# Evolution of networks

@article{Dorogovtsev2001EvolutionON, title={Evolution of networks}, author={Sergey N. Dorogovtsev and Jos{\'e} F. F. Mendes}, journal={Advances in Physics}, year={2001}, volume={51}, pages={1079 - 1187} }

We review the recent rapid progress in the statistical physics of evolving networks. Interest has focused mainly on the structural properties of complex networks in communications, biology, social sciences and economics. A number of giant artificial networks of this kind have recently been created, which opens a wide field for the study of their topology, evolution, and the complex processes which occur in them. Such networks possess a rich set of scaling properties. A number of them are scale…

## 3,175 Citations

### Theory of Random Networks and Their Role in Communications Networks

- Computer ScienceWeb Dynamics
- 2004

The goal of this review is to show from a physicist’s point of view the many problems addressed by such networks and the present understanding within the field.

### Stochastically evolving networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2003

We discuss a class of models for the evolution of networks in which new nodes are recruited into the network at random times, and links between existing nodes that are not yet directly connected may…

### Temporal evolution of the degree distribution of alters in growing networks

- Computer ScienceNetwork Science
- 2018

This paper provides the first theoretical study of the temporal evolution of the nearest-neighbor degree distribution for arbitrary networks (with any size) in arbitrary times and demonstrates that the existing result in the literature on the asymptotic behavior of the Pearson coefficient of growing networks under the preferential attachment mechanism is incorrect.

### Random Graphs and Complex Networks

- Computer ScienceCambridge Series in Statistical and Probabilistic Mathematics
- 2016

This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.

### The topology and dynamics of complex networks

- Computer Science
- 2005

It is demonstrated that policies that discriminate between the nodes, curing mostly the highly connected nodes, can restore a finite epidemic threshold and potentially eradicate the virus.

### Synchronization in Complex Dynamical Networks and Its Applications

- Computer Science
- 2003

The economic-cycle synchronous phenomenon in the World Trade Web, a scale-free type of network, is used to illustrate an application of the network synchronization mechanism.

### Complex Networks: Structure and Dynamics

- Computer Science
- 2014

The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.

### Dynamic and Topological Interplay in Adaptive Networks

- Biology
- 2009

This chapter is devoted to adaptive networks which combine topological evolution of the network with dynamics in the network nodes – a property which yields a rich dynamical interplay between the state and the topology of thenetwork.

### Parallelism in simulation and modeling of scale-free complex networks

- Computer ScienceParallel Comput.
- 2010

## References

SHOWING 1-10 OF 296 REFERENCES

### Random networks created by biological evolution.

- Computer SciencePhysical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
- 2000

The model is a generalization of the Bak-Sneppen model of biological evolution, with the modification that the underlying network can evolve by adding and removing sites, and various geometrical properties of the network are studied.

### Statistical mechanics of complex networks

- Computer ScienceArXiv
- 2001

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

### Scaling properties of scale-free evolving networks: continuous approach.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

It is shown that permanent random damage to a growing scale-free network-a permanent deletion of some links-radically changes the values of the scaling exponents, and the limits of their validity are indicated.

### On the properties of small-world network models

- Physics
- 1999

Abstract:We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties…

### Emergence of scaling in random networks

- Computer ScienceScience
- 1999

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.

### Highly clustered scale-free networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002

The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate.

### Anomalous percolation properties of growing networks.

- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

The anomalous phase transition of the emergence of the giant connected component in scale-free networks growing under mechanism of preferential linking is described and exact results for the size and the distribution of vertices among connected components are obtained.

### Spectra of "real-world" graphs: beyond the semicircle law.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

Methods to determine the eigenvalues of networks comparable in size to real systems are developed, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs.