The physics of communicability in complex networks

Abstract

a b s t r a c tA fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that communication and correlation in networks can take place through many more routes than the shortest paths, a fact that may not have been sufficiently appreciated in previously proposed correlation measures. In contrast to these, the communicability measures reviewed in this paper are defined by taking into account all possible routes between two nodes, assigning smaller weights to longer ones. This point of view naturally leads to the definition of communicability in terms of matrix functions, such as the exponential, resolvent, and hyperbolic functions, in which the matrix argument is either the adjacency matrix or the graph Laplacian associated with the network.Considerable insight on communicability can be gained by modeling a network as a system of oscillators and deriving physical interpretations, both classical and quantummechanical, of various communicability functions. Applications of communicability measures to the analysis of complex systems are illustrated on a variety of biological, physical and social networks. The last part of the paper is devoted to a review of the notion of locality in complex networks and to computational aspects that by exploiting sparsity can greatly reduce the computational efforts for the calculation of communicability functions for large networks.

On the Limiting Behavior of Parameter-Dependent Network Centrality Measures

“…Conversely, as β → ∞, the temperature goes to 0 and the network "freezes." We refer the reader to [25] for an extensive discussion and applications of these physical analogies.…”

Smart random walkers: The cost of knowing the path

“…In practice, this prevents the problem from being solvable in large networks. At variance, other related problems [5,22] can be solved in polynomial time. The average walk length is obtained by a Monte Carlo One can see this ratio remains small in the whole range of γ we explored.…”

“…It means that the efficiency is determined by communicability between the source and the target. This problem was studied in detail by Estrada et al [4,5], who introduced a penalty based on the lengths of the paths. Even more, this is a problem related to the first passage time and has been investigated in several paradigmatic network models [6].…”

Make It or Break It: Manipulating Robustness in Large Networks

“…Moreover, natural connectivity is closely related to selfcommunicability [10] of nodes in the network. The general communicability function between nodes p, q is written as…”