Complex networks in the Euclidean space of communicability distances

Tools

Estrada, Ernesto (2012) Complex networks in the Euclidean space of communicability distances. Physical Review E, 85 (6). 066122. ISSN 2470-0053 (https://doi.org/10.1103/PhysRevE.85.066122)

Full text not available in this repository.Request a copy

Abstract

We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded routes in networks where simultaneous submission of packages is taking place. We define an index Q based on communicability and shortest path distances, which allows reinterpreting the “small-world” phenomenon as the region of minimum Q in the Watts-Strogatz model. It also allows the classification and analysis of networks with different efficiency of spatial uses. Consequently, the communicability distance displays unique features for the analysis of complex networks in different scenarios.

ORCID iDs

Estrada, Ernesto ORCID logoORCID: https://orcid.org/0000-0002-3066-7418;
CORE (COnnecting REpositories)