Physics – Physics and Society
Scientific paper
2009-05-26
Appl. Math. Comp. 214 (2009) 500-511
Physics
Physics and Society
36 pages, 5 figures, to appear in Applied Mathematics and Computation
Scientific paper
10.1016/j.amc.2009.04.024
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.
Estrada Ernesto
Hatano Naomichi
No associations
LandOfFree
Communicability Graph and Community Structures in Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Communicability Graph and Community Structures in Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communicability Graph and Community Structures in Complex Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-646205