The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Total communicability as a centrality measure
Open accessAbstract
We examine node centrality measures based on the notion of total communicability, defined in terms of the row sums of matrix functions of the adjacency matrix of the network. Our main focus is on the matrix exponential and the resolvent, which have natural interpretations in terms of walks on the underlying graph. While such measures have been used before for ranking nodes in a network, we show that they can be computed very rapidly even in the case of large networks. Furthermore, we propose the (normalized) total sum of node communicabilities as a useful measure of network connectivity. Extensive numerical studies are conducted in order to compare this centrality measure with the closely related ones of subgraph centrality [E. Estrada and J. A. Rodríguez-Velázquez, Phys. Rev. E, 71 (2005), 056103] and Katz centrality [L. Katz, Psychometrica, 18 (1953), pp. 39–43]. Both synthetic and real-world networks are used in the computations.
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
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Functions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · doi:10.1515/9781400830329 · Cited by 814
(2003) · doi:10.5555/644108.644113 · Cited by 762
Communicability in complex networks
Estrada, E., & Hatano, N. (2008) · Physical Review E · doi:10.1103/physreve.77.036111 · Cited by 719
Cited by
A map of abstract relational knowledge in the human hippocampal-entorhinal cortex
Garvert, M. M., Dolan, R. J., & Behrens, T. E. (2017) · eLife · doi:10.7554/elife.17086 · Cited by 379
Consistency and differences between centrality measures across distinct classes of networks
Oldham, S., Fulcher, B., Parkes, L., Arnatkevic̆iūtė, A., Suo, C., & Fornito, A. (2019) · PLOS ONE · doi:10.1371/journal.pone.0220061 · Cited by 296
Metadata
- Authors
- Benzi, M., & Klymko, C.
- Venue
- Journal of Complex Networks
- Publisher
- Oxford University Press (OUP)
- Published
- 2013-05-17
- Volume
- 1
- Issue
- 2
- Pages
- 124-149
- ISSN
- 2051-1310 (ISSN-L)
- 2051-1329
- OpenAlex
- W2130071292
- Cited by
- 200
- References
- 6
- FWCI
- 7.65
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Total communicability as a centrality measure. https://app.cochat.ai/papers/10.1093/comnet/cnt007
- The paper
- Benzi, M., & Klymko, C. (2013). Total communicability as a centrality measure. Journal of Complex Networks. https://doi.org/10.1093/comnet/cnt007
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.