## Evolution of networks (2002)

### Cached

### Download Links

Venue: | Adv. Phys |

Citations: | 269 - 2 self |

### BibTeX

@INPROCEEDINGS{Dorogovtsev02evolutionof,

author = {S. N. Dorogovtsev and J. F. F. Mendes},

title = {Evolution of networks},

booktitle = {Adv. Phys},

year = {2002},

pages = {1079--1187}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 of them are scale-free and show striking resilience against random breakdowns. In spite of large sizes of these networks, the distances between most their vertices are short — a feature known as the “smallworld” effect. We discuss how growing networks self-organize into scale-free structures and the role of the mechanism of preferential linking. We consider the topological and structural properties of evolving networks, and percolation in these networks. We present a number of models demonstrating the main features of evolving networks and discuss current approaches for their simulation and analytical study. Applications of the general results to particular networks in Nature are discussed. We demonstrate the generic connections of the network growth processes with the general problems

### Citations

3231 | The anatomy of a large-scale hypertextual Web search engine
- Brin, Page
- 1998
(Show Context)
Citation Context ...6 , 59 × 106 , 41 × 106 , and 15 × 106 pages, respectively. The Web grows much faster than the possibilities of hardware. Even the best search engines index less than one half of all pages of the Web =-=[7,8,83,86]-=-. Update of files cached by them for quick search usually takes many months. The only way to improve the situation is indexing of special areas of the WWW, “cyber-communities”, to provide possibility ... |

2698 | sources in a hyperlinked environment - Kleinberg, ”Authoritative - 1998 |

2085 | Emergence of Scaling in Random Networks
- Barabási, Albert
- 1999
(Show Context)
Citation Context ...ain question arising for real networks – how networks becomes specifically structured during their growth. Quite recently, general features of structural organization of such networks were discovered =-=[2,3,5,6,27,41,55,56,58]-=-. It has become clear that their complex scale-free structure is a natural consequence of the principles of their growth. Some simple basic ideas have been proposed. Self-organization of growing netwo... |

1897 |
Collective dynamics of ’small-world’ networks
- Watts, Strogatz
- 1998
(Show Context)
Citation Context ...xamples of a great class of evolving networks. Numerous networks, e.g., collaboration networks [11–15], public relations nets [16–20], citations of scientific papers [21–27], some industrial networks =-=[11,12,28]-=-, transportation networks [29,30], nets of relations between enterprises and agents in financial markets [31], telephone call graphs [32], many biological networks [33–45], food and ecological webs [4... |

1839 | Random graphs
- Erdos, Renyi
- 1954
(Show Context)
Citation Context ...tical graph theory [74–76]. Some basic ideas, used later by physicists, were proposed long ago by the incredibly prolific and outstanding Hungarian mathematician Paul Erdös and his collaborator Rényi =-=[77,78]-=-. Nevertheless, the most intriguing type of growing networks, which evolve into scale-free structures, hasn’t been studied by graph theory. Most of the results of graph theory [79,80] are related to t... |

1791 | Random Graphs
- Bollobás
- 1985
(Show Context)
Citation Context ...y found. We have seen that its Poisson degree distribution produces Φ(y) = ez1(y−1) . Then 1−W = e−z1W . Hence the giant connected component of such a network exists if its average degree exceeds one =-=[74]-=-. From Eqs. (109) and (110), one can understand the analytical properties of H(y) and H1(y) near the percolation threshold. The analytical structure of H(y), in turn, determines the asymptotic form of... |

1572 |
Neural networks and physical systems with emergent collective computational abilities
- Hopfield
(Show Context)
Citation Context ...eir extensive and easily accessible documentation allow reliable and informative experimental investigation of their structure and properties. Unfortunately, the statistical theory of neural networks =-=[53,54]-=- seems to be rather useless for the understanding of problems of the evolution of networks, since this advanced theory does not seriously touch on the main question arising for real networks – how net... |

1241 | On power-law relationships of the internet topology
- Faloutsos, Faloutsos, et al.
- 1999
(Show Context)
Citation Context ...ain question arising for real networks – how networks becomes specifically structured during their growth. Quite recently, general features of structural organization of such networks were discovered =-=[2,3,5,6,27,41,55,56,58]-=-. It has become clear that their complex scale-free structure is a natural consequence of the principles of their growth. Some simple basic ideas have been proposed. Self-organization of growing netwo... |

1194 | Statistical mechanics of complex networks
- ALBERT, RÉKA, et al.
(Show Context)
Citation Context ... interesting problems (see, e.g., Refs. [237–251]). After this review had been submitted, we learned about the review of Albert and Barabási on the statistical mechanics of networks under preparation =-=[252]-=-. We call the reader’s attention to this paper. Most studies which we reviewed focused on structural properties of growing networks. Two aspects of the problem can be pointed out. (i) Specific mechani... |

1136 | Extremal Graph Theory - Bollobás - 1978 |

1005 |
The Origins of Order: self-organization and selection in evolution
- KAUFFMAN
- 1993
(Show Context)
Citation Context ...= 0.26 ≫ 14/282 ∼ 0.05. 2. Networks of metabolic reactions The valuable example of a biological network with the extremely rich topological structure is provided by the network of metabolic reactions =-=[33,34,67]-=-. This is a particular case of chemical reactions graphs [67,120,121]. At present, such networks are documented for several organisms. Their vertices are substrates – molecular compounds, and the edge... |

980 | Human behavior and the principle of least effort - Zipf - 1949 |

804 | The small world problem - Milgram - 1967 |

742 |
A comprehensive analysis of proteinprotein interactions in Saccharomyces cerevisiae
- Uetz, Giot, et al.
- 2000
(Show Context)
Citation Context ..., and the network also contains unit loops, so that its general structure resembles the structure of a food web (see Fig. 8). Recently large maps of protein-protein interaction networks were obtained =-=[40,42,43]-=- which may be used for structural analysis. In Ref. [44] (for details see Ref. [122]), the distribution of connections in the protein-protein interaction network of the yeast, S. cerevisiae was studie... |

728 | On triangle-free random graphs
- Luczak
(Show Context)
Citation Context ...l on the latter efficient approach for equilibrium networks constructed by the Molloy-Reed procedure. The generating function (or the Z-transform) apparatus is used extensively in modern graph theory =-=[76]-=-. The Z-transform of the degree distribution is defined as Φ(y) = ∞� P (k)y k , (99) k=0 where |y| ≤ 1. Obviously, Φ(1) = 1. For example, for the Poisson distribution (see Eq. (5) in Sec. VI), this yi... |

622 | The small-world phenomenon: An algorithmic perspective - Kleinberg - 2000 |

608 |
A comprehensive two-hybrid analysis to explore the yeast protein interactome
- Ito, Chiba, et al.
- 1996
(Show Context)
Citation Context ..., and the network also contains unit loops, so that its general structure resembles the structure of a food web (see Fig. 8). Recently large maps of protein-protein interaction networks were obtained =-=[40,42,43]-=- which may be used for structural analysis. In Ref. [44] (for details see Ref. [122]), the distribution of connections in the protein-protein interaction network of the yeast, S. cerevisiae was studie... |

511 | Error and attack tolerance of complex networks
- Albert, Jeong, et al.
- 2000
(Show Context)
Citation Context ...) β ] and P (k) = k −{1+1/[β(1−c)]} F (k/t β ). One can show that the permanent deletion of a fraction of vertices with the largest values of degree, that is an analogy of intentional damage (attack) =-=[59,63,62]-=-, destroys the scaling behavior of the network [175]. L. Eigenvalue spectrum of the adjacency matrix The structure of the adjacency matrix and, therefore, of the network itself, can be characterized b... |

481 | Introduction to Percolation Theory - Stauffer, Aharony - 1994 |

412 |
Scientific Collaboration Networks
- Newman
(Show Context)
Citation Context ...s of the same kind are absent. Edges are undirected. For instance, in the scientific collaboration bipartite graphs, one kind of vertices corresponds to authors and the other one is scientific papers =-=[13,14]-=-. In movie actor graphs, these two kinds of vertices are actors and films, respectively [11,28,102]. FIG. 3. A bipartite collaboration graph (a) and one of its one-mode projections (b) [61]. Collabora... |

369 | The Theory of Branching Processes - Harris - 1963 |

368 | The large-scale organization of metabolic networks
- Jeong, Tombor, et al.
- 2000
(Show Context)
Citation Context ...ain question arising for real networks – how networks becomes specifically structured during their growth. Quite recently, general features of structural organization of such networks were discovered =-=[2,3,5,6,27,41,55,56,58]-=-. It has become clear that their complex scale-free structure is a natural consequence of the principles of their growth. Some simple basic ideas have been proposed. Self-organization of growing netwo... |

356 | Metabolic stability and epigenesis in randomly constructed genetic nets - Kauffman - 1969 |

349 |
Exploring complex networks
- Strogatz
- 2001
(Show Context)
Citation Context |

348 |
Random graphs with arbitrary degree distributions and their applications
- Newman, Strogatz, et al.
- 2001
(Show Context)
Citation Context .... B. Networks of collaborations The set of collaborations can be represented by the bipartite graph containing two distinct types of vertices — collaborators and acts of collaborations (see Fig. 3,a) =-=[61]-=-. Collaborators connect together through collaboration acts, so in this type of a bipartite graph, direct connections between vertices of the same kind are absent. Edges are undirected. For instance, ... |

348 | Social Network Analysis”. A handbook - Scott - 1991 |

337 | Inferring Web communities from link topology - Kleinberg, Raghavan |

332 | A random graph model for massive graphs
- Aiello, Lu
- 2000
(Show Context)
Citation Context ...s of scientific papers [21–27], some industrial networks [11,12,28], transportation networks [29,30], nets of relations between enterprises and agents in financial markets [31], telephone call graphs =-=[32]-=-, many biological networks [33–45], food and ecological webs [46–52], etc., belong to it. The finiteness of these networks sets serious restrictions on extracting useful experimental data because of s... |

329 | Heuristics for Internet map discovery
- Govindan, Tangmunarunkit
- 2000
(Show Context)
Citation Context ...about 100 millions hosts. However, it is not the hosts that determine the structure of the Internet, but rather, routers and domains. In July of 2000, there were about 150 000 routers in the Internet =-=[104]-=-. Latter, the number rose to 228 265 (data from Ref. [105]). Thus, one can consider the topology of the Internet on a router level or inter-domain topology [5]. In the latter case, it is actually a sm... |

307 | Classes of small-world networks - Amaral, Scala, et al. - 2000 |

304 | The web as a graph: Measurements, models and methods - Kleinberg, Kumar, et al. - 1999 |

287 | A Critical Point for Random Graphs with a Given Degree Sequence: Random Struct
- Molloy, Reed
- 1995
(Show Context)
Citation Context ...ctions (we use this term in a much more wide sense). Nevertheless, one should note the very important results obtained recently by mathematicians for graphs with arbitrary distribution of connections =-=[81,82]-=-. The mostly empirical study of specific large random networks such as nets of citations in scientific literature has a long history [21–24]. Unfortunately, their limited sizes did not allow to get re... |

282 | At home in the universe: The search for the laws of self-organization and complexity - Kauffman - 1995 |

279 |
Lethality and centrality in protein networks
- Jeong, Mason, et al.
- 2001
(Show Context)
Citation Context ...l structure resembles the structure of a food web (see Fig. 8). Recently large maps of protein-protein interaction networks were obtained [40,42,43] which may be used for structural analysis. In Ref. =-=[44]-=- (for details see Ref. [122]), the distribution of connections in the protein-protein interaction network of the yeast, S. cerevisiae was studied using the map from Ref. [40] (see also Ref. [45]). The... |

277 | Epidemic spreading in scale-free networks - Pastor-Satorras, Vespignani - 2001 |

268 | d’Economie Politique - Pareto, Manuel - 1909 |

262 | A synthetic oscillatory network of transcriptional regulators." Nature 403(6767 - Elowitz, Leibler - 2000 |

249 |
On a class of skew distribution functions
- Simon
- 1955
(Show Context)
Citation Context ...the initial conditions is visible at any size of the network. Similar humps (or peaks) at the cut-off position were also observed recently [172] in the non-stationary distributions of the Simon model =-=[65,66]-=- (see Sec. XII B). In Sec. V C 2 we have mentioned a kind of bipartite sub-graphs (bipartite cliques) which are used for indexing of cyber-communities in a large directed graph — the WWW. In such a bi... |

233 | Self-organized criticality: an explanation of 1/f noise - Bak, Tang, et al. - 1987 |

230 | Search in power-law networks - Adamic, Lukose, et al. - 2001 |

221 |
Modeling Brain Function: The World of Attractor Neural Networks
- Amit
- 1989
(Show Context)
Citation Context ...eir extensive and easily accessible documentation allow reliable and informative experimental investigation of their structure and properties. Unfortunately, the statistical theory of neural networks =-=[53,54]-=- seems to be rather useless for the understanding of problems of the evolution of networks, since this advanced theory does not seriously touch on the main question arising for real networks – how net... |

218 | Scale‐Free Characteristics of Random Networks: The Topology of the World‐Wide Web - Barabási, Albert, et al. - 1999 |

218 | Graph structure in the web - Broder, Kumar, et al. |

214 | Stochastic models for the web graph
- Kumar, Raghavan, et al.
(Show Context)
Citation Context ... directed edges connecting h hubs to a authorities are present (see Fig. 7). One may easily check that in a large equilibrium random graph the total number of these bipartite sub-graphs is negligible =-=[173]-=-. This is not the case for the growing networks. In the model under discussion, the statistics of the bipartite sub-graphs is very simple, so that we use this model as an illustrating example. Let us ... |

210 | Mean-field Theory for Scale-free Random Networks,” Physica A 272
- Barabási, Albert, et al.
- 1999
(Show Context)
Citation Context ...es a scale-free network, and the γ exponent of its distribution equals 3 [55–57]. This value is exact, see Ref. [94,169] and the discussion below. We emphasize that the preferential linking mechanism =-=[55,56]-=- (1999) is the basic idea of the modern theory of evolving networks. Notice that preferential attachment may also arise effectively, in an indirect way (e.g., see Sec. IX C and models from Refs. [167,... |

205 | Evolution of the social network of scientific collaborations. Physica A 311, 590-614 Barjak, F. (27 October 2007) M4 Final Report: Achieving transition to Virtual Research Organisation
- Barabasi, Jeong, et al.
- 2002
(Show Context)
Citation Context ... 975 different authors and 70 901 published paper) and neuro-science (NS) (209 293 authors with 3 534 724 connections and 210 750 papers) journals issued in the period 1991-1998 were scanned in Refs. =-=[15,101]-=-. Degree distributions of these collaborating networks were fitted by power laws with exponents 2.4 (M) and 2.1 (NS). What is important, it was found that the mean degrees of these networks were not c... |

204 | Navigation in a small world - Kleinberg |

196 | Emergence of scaling in random networks - AL, Albert - 1999 |

194 |
Accessibility of Information on the Web
- Lawrence
- 1999
(Show Context)
Citation Context ...6 , 59 × 106 , 41 × 106 , and 15 × 106 pages, respectively. The Web grows much faster than the possibilities of hardware. Even the best search engines index less than one half of all pages of the Web =-=[7,8,83,86]-=-. Update of files cached by them for quick search usually takes many months. The only way to improve the situation is indexing of special areas of the WWW, “cyber-communities”, to provide possibility ... |

185 | Topology of evolving networks: local events and universality - Albert, Barabasi |