Communicability graph and community structures in complex networks

Tools

Estrada, Ernesto and Hatano, Naomichi, Institute of Industrial Science, University of Tokyo (Funder), New Professors Fund University of Strathclyde (Funder) (2009) Communicability graph and community structures in complex networks. Applied Mathematics and Computation, 214 (2). pp. 500-511. ISSN 0096-3003 (https://doi.org/10.1016/j.amc.2009.04.024)

[thumbnail of strathprints014296]
Preview
 Text. Filename: strathprints014296.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (402kB)| Preview

Abstract

We use the concept of the network communicability (Phys. Rev. E 77 (2008) 036111) to define communities in a complex network. The communities are defined as the cliques of a 'communicability graph', which has the same set of nodes as the complex network and links determined by the communicability function. Then, the problem of finding the network communities is transformed to an all-clique problem of the communicability graph. We discuss the efficiency of this algorithm of community detection. In addition, we extend here the concept of the communicability to account for the strength of the interactions between the nodes by using the concept of inverse temperature of the network. Finally, we develop an algorithm to manage the different degrees of overlapping between the communities in a complex network. We then analyze the USA airport network, for which we successfully detect two big communities of the eastern airports and of the western/central airports as well as two bridging central communities. In striking contrast, a well-known algorithm groups all but two of the continental airports into one community.

ORCID iDs

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