The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
Network Properties Revealed through Matrix Functions
Abstract
The emerging field of network science deals with the tasks of modeling, comparing, and summarizing large data sets that describe complex interactions. Because pairwise affinity data can be stored in a two-dimensional array, graph theory and applied linear algebra provide extremely useful tools. Here, we focus on the general concepts of centrality, communicability, and betweenness, each of which quantifies important features in a network. Some recent work in the mathematical physics literature has shown that the exponential of a network's adjacency matrix can be used as the basis for defining and computing specific versions of these measures. We introduce here a general class of measures based on matrix functions, and show that a particular case involving a matrix resolvent arises naturally from graph-theoretic arguments. We also point out connections between these measures and the quantities typically computed when spectral methods are used for data mining tasks such as clustering and ordering. We finish with computational examples showing the new matrix resolvent version applied to real networks.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,993
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
(1999) · Cited by 12,854
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Cited by
Network Centrality in the Human Functional Connectome
Zuo, X.-N., Ehmke, R., Mennes, M., Imperati, D., Castellanos, F. X., Sporns, O., & Milham, M. P. (2012) · Cerebral Cortex · doi:10.1093/cercor/bhr269 · Cited by 1,175
Zuo, X.-N., & Xing, X.-X. (2014) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2014.05.009 · Cited by 660
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 646
From networks to optimal higher-order models of complex systems
Lambiotte, R., Rosvall, M., & Scholtes, I. (2019) · Nature Physics · doi:10.1038/s41567-019-0459-y · Cited by 483
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
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-citationInformation cascades in complex networks
Jalili, M., & Perc, M. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx019 · Cited by 248
Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison
De Domenico, M., & Biamonte, J. (2016) · Physical Review X · doi:10.1103/physrevx.6.041062 · Cited by 160
Metadata
- Authors
- Estrada, E., & Higham, D. J.
- Venue
- SIAM Review
- Published
- 2010-01
- Volume
- 52
- Issue
- 4
- Pages
- 696-714
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2016170913
- Cited by
- 313
- References
- 65
- FWCI
- 8.78
- Type
- journal article
- Language
- en
- Open access
- closed
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.