The physics of communicability in complex networks

Ernesto Estrada, Naomichi Hatano, Michele Benzi

Research output: Contribution to journalArticle

137 Citations (Scopus)

Abstract

A 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.
LanguageEnglish
Pages89-119
Number of pages31
JournalPhysics Reports
Volume514
Issue number3
Early online date17 Jan 2012
DOIs
Publication statusPublished - May 2012

Fingerprint

physics
matrices
routes
hyperbolic functions
information flow
exponential functions
complex systems
communication
oscillators

Keywords

  • quantitative measurement
  • communicability
  • network correlation

Cite this

Estrada, Ernesto ; Hatano, Naomichi ; Benzi, Michele. / The physics of communicability in complex networks. In: Physics Reports. 2012 ; Vol. 514, No. 3. pp. 89-119.
@article{bb6e6e66caf241a6b891187208f273c5,
title = "The physics of communicability in complex networks",
abstract = "A 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.",
keywords = "quantitative measurement, communicability, network correlation",
author = "Ernesto Estrada and Naomichi Hatano and Michele Benzi",
year = "2012",
month = "5",
doi = "10.1016/j.physrep.2012.01.006",
language = "English",
volume = "514",
pages = "89--119",
journal = "Physics Reports",
issn = "0370-1573",
number = "3",

}

The physics of communicability in complex networks. / Estrada, Ernesto; Hatano, Naomichi; Benzi, Michele.

In: Physics Reports, Vol. 514, No. 3, 05.2012, p. 89-119.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The physics of communicability in complex networks

AU - Estrada, Ernesto

AU - Hatano, Naomichi

AU - Benzi, Michele

PY - 2012/5

Y1 - 2012/5

N2 - A 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.

AB - A 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.

KW - quantitative measurement

KW - communicability

KW - network correlation

U2 - 10.1016/j.physrep.2012.01.006

DO - 10.1016/j.physrep.2012.01.006

M3 - Article

VL - 514

SP - 89

EP - 119

JO - Physics Reports

T2 - Physics Reports

JF - Physics Reports

SN - 0370-1573

IS - 3

ER -