Critical phenomena in complex networks

Abstract

The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researchers have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.Comment: Review article, 79 pages, 43 figures, 1 table, 508 references, extende

The art of community detection

“…In a large random network node degrees are distributed according to the normal distribution, but in many manmade and biological networks the degree distribution follows a power-law. In the human protein-protein interaction networks 3,4 , for instance, some proteins act as hubs, they are highly connected, and interact with more than 200 other proteins contrary to most proteins that interact with only a few other proteins.Various local to global measures have been introduced to unveil the organizational principles of complex networks 5,6,7,8,9 . Maslov and Sneppen 10 discovered that who links to whom can depend on node degree; in many biological networks, high degree nodes systematically link to nodes of low degree.…”

Continuous spin models on annealed generalized random graphs

“…Our analysis also applies to models for rotators σ ∈ S q taking values in the q-dimensional sphere with the O(q)-invariant interaction e Φ(σ,σ ′ ) = c + θ σ, σ ′ , see Section 5.3. They are believed to be in the same universality class as the ones with the standard interaction e Φ(σ,σ ′ ) = e θ σ,σ ′ [15]. This is a statement whose full mathematical justification would however need an investigation of the corresponding infinite-dimensional fixed point problem, and would be an interesting analytical problem in itself for future study.…”

“…describe an opinion or an internal state of a person [33] or neurons in the brain [19]. The interaction between the behavior of spin models and the properties of the random graph is of special interest, see for example [15] for an overview of (often non-rigorous) results in the physics literature.…”

Ranking Spreaders in Complex Networks Based on the Most Influential Neighbors

“…It is conducive to containing epidemic spread, studying information dissemination, and controlling virus diffusion [1][2][3][4][5][6][7][8][9][10][11][12][13][14]. In this view, researchers have developed various methods, such as degree centrality (DC) [15], betweenness centrality (BC) [16], closeness centrality (CC) [17], and semilocal centrality [18] to identify the most influential spreaders in a network.…”