The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Spectral centrality measures in complex networks
Open accessAbstract
Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes based on their topological importance within a graph. Here we review and compare centrality measures based on spectral properties of graph matrices. We shall focus on PageRank (PR), eigenvector centrality (EV), and the hub and authority scores of the HITS algorithm. We derive simple relations between the measures and the (in)degree of the nodes, in some limits. We also compare the rankings obtained with different centrality measures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Cited by
The Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2391998 · Cited by 398
PageRank for ranking authors in co‐citation networks
Ding, Y., Yan, E., Frazho, A., & Caverlee, J. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21171 · Cited by 396
Applying centrality measures to impact analysis: A coauthorship network analysis
Yan, E., & Ding, Y. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21128 · Cited by 390
Greening ports and maritime logistics: A review
Davarzani, H., Fahimnia, B., Bell, M., & Sarkis, J. (2016) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2015.07.007 · Cited by 280
Metadata
- Authors
- Perra, N., & Fortunato, S.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2008-09-05
- Volume
- 78
- Issue
- 3
- Pages
- 036107-036107
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2007785292
- Cited by
- 158
- References
- 2
- FWCI
- 4.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spectral centrality measures in complex networks. https://app.cochat.ai/papers/10.1103/physreve.78.036107
- The paper
- Perra, N., & Fortunato, S. (2008). Spectral centrality measures in complex networks. Physical Review E. https://doi.org/10.1103/physreve.78.036107
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.