Communicability graph and community structures in complex networks
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We use the concept of the network communicability [E. Estrada, N. Hatano, Communicability in complex networks, 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373 · cited 4×
“’s method [20], our method finds the cliques in this communicability graph, not the cliques existing in the original network.”
BackgroundMethodInfluentialFunctional cartography of complex metabolic networks
Guimerà, R., & Nunes Amaral, L. A. (2005) · Nature · doi:10.1038/nature03288 · Cited by 3,983
Communicability in complex networks
Estrada, E., & Hatano, N. (2008) · Physical Review E · doi:10.1103/physreve.77.036111 · Cited by 719 · cited 6×
“We thereby defined [8] that the nodes p and q belong to the same cluster if the quantity DGp,q is positive, and they do not if it is.”
BackgroundMethodInfluentialSelf-citation
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Another possibility, suggested by Estrada and Hatano [89,90], is to weigh paths of length l with the inverse factorial 1/l!.”
BackgroundLeskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
The physics of communicability in complex networks
Estrada, E., Hatano, N., & Benzi, M. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.01.006 · Cited by 352
Self-citationKovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
neuroVIISAS: Approaching Multiscale Simulation of the Rat Connectome
Schmitt, O., & Eipert, P. (2012) · Neuroinformatics · doi:10.1007/s12021-012-9141-6 · Cited by 51
Community Detection in Quantum Complex Networks
Faccin, M., Migdał, P., Johnson, T. H., Bergholm, V., & Biamonte, J. D. (2014) · Physical Review X · doi:10.1103/physrevx.4.041012 · Cited by 43
“In classical networks optimality is, for example, defined statistically [30], e.g. in terms of connectivity [1] or commu-nicability [31, 32], or increasingly, and sometimes relat-edly [33], in terms of stochastic random walks [34–36].”
Background
Metadata
- Authors
- Estrada, E., & Hatano, N.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2009-08
- Volume
- 214
- Issue
- 2
- Pages
- 500-511
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2024529797
- Cited by
- 71
- References
- 3
- FWCI
- 6.25
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.