Estrada, Ernesto (2012) Complex networks in the Euclidean space of communicability distances. Physical Review E, 85 (6). ISSN 1539-3755
Full text not available in this repository. (Request a copy from the Strathclyde author)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.
| Item type: | Article |
|---|---|
| ID code: | 40666 |
| Keywords: | complex networks, Euclidean space, communicability distances, Mathematics |
| Subjects: | Science > Mathematics |
| Department: | Faculty of Science > Mathematics and Statistics |
| Related URLs: | |
| Depositing user: | Pure Administrator |
| Date Deposited: | 02 Aug 2012 11:59 |
| Last modified: | 02 Aug 2012 11:59 |
| URI: | http://strathprints.strath.ac.uk/id/eprint/40666 |
Actions (login required)
| View Item |