Estrada, E. and Hatano, N. and , Ramon y Cajal program Spain (Funder) (2008) Communicability in complex networks. Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 77 (3). ISSN 1063651X

PDF (strathprints014297.pdf)
strathprints014297.pdf Download (825kB)  Preview 
Abstract
We propose a new measure of the communicability of a complex network, which is a broad generalization of the concept of the shortest path. According to the new measure, most of the realworld networks display the largest communicability between the most connected (popular) nodes of the network (assortative communicability). There are also several networks with the disassortative communicability, where the most "popular" nodes communicate very poorly to each other. Using this information we classify a diverse set of realworld complex systems into a small number of universality classes based on their structuredynamic correlation. In addition, the new communicability measure is able to distinguish finer structures of networks, such as communities into which a network is divided. A community is unambiguously defined here as a set of nodes displaying larger communicability among them than to the rest of the nodes in the network.
Item type:  Article 

ID code:  14297 
Keywords:  complex networks, network theory (graphs), set theory, Mathematics, Physics, Physics and Astronomy(all), Mathematical Physics, Statistical and Nonlinear Physics, Condensed Matter Physics 
Subjects:  Science > Mathematics Science > Physics 
Department:  Faculty of Science > Mathematics and Statistics 
Depositing user:  Mrs Carolynne Westwood 
Date Deposited:  22 Jan 2010 11:54 
Last modified:  24 Jul 2015 10:04 
Related URLs:  
URI:  http://strathprints.strath.ac.uk/id/eprint/14297 
Actions (login required)
View Item 