The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Localization and centrality in networks
Open accessAbstract
Eigenvector centrality is a common measure of the importance of nodes in a network. Here we show that under common conditions the eigenvector centrality displays a localization transition that causes most of the weight of the centrality to concentrate on a small number of nodes in the network. In this regime the measure is no longer useful for distinguishing among the remaining nodes and its efficacy as a network metric is impaired. As a remedy, we propose an alternative centrality measure based on the nonbacktracking matrix, which gives results closely similar to the standard eigenvector centrality in dense networks where the latter is well behaved but avoids localization and gives useful results in regimes where the standard centrality fails.
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
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
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
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Self-citationFactoring and weighting approaches to status scores and clique identification
Bonacich, P. (1972) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1972.9989806 · Cited by 3,207
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Superfamilies of Evolved and Designed Networks
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004) · Science · doi:10.1126/science.1089167 · Cited by 1,412
Topics in Random Matrix Theory
Tao, T. (2012) · Graduate Studies in Mathematics · doi:10.1090/gsm/132 · Cited by 868
Exploratory Social Network Analysis with Pajek
de Nooy, W., Mrvar, A., & Batagelj, V. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511996368 · Cited by 735
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
Spectra of “real-world” graphs: Beyond the semicircle law
Farkas, I. J., Derényi, I., Barabási, A.-L., & Vicsek, T. (2001) · Physical Review E · doi:10.1103/physreve.64.026704 · Cited by 499
Spectra of random graphs with given expected degrees
Chung, F., Lu, L., & Vu, V. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0937490100 · Cited by 492
The Eigenfactor™ Metrics: Figure 1.
Bergstrom, C. T., West, J. D., & Wiseman, M. A. (2008) · The Journal of Neuroscience · doi:10.1523/jneurosci.0003-08.2008 · Cited by 407
Introduction to Linear Algebra
DeFranza, J., & Gagliardi, D. (2008) · Cited by 378
Localization and Spreading of Diseases in Complex Networks
Goltsev, A. V., Dorogovtsev, S. N., Oliveira, J. G., & Mendes, J. F. F. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.128702 · Cited by 347
PSEUDO-LIKELIHOOD METHODS FOR COMMUNITY DETECTION IN LARGE SPARSE NETWORKS
Amini, A., Chen, A., Bickel, P. J., & Levina, E. (2013) · Cited by 335
Size-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311 · cited 1×
“(cid:10) (cid:11) h i In a power-law network with n vertices and exponent α , the highest degree goes as d ∼ n 1 / ( α − 1) [17] and hence increases with increasing n , while (cid:10) k 2 (cid:11) ∼ d 3 − α and h k i ∼ constant for the common case of α < 3.”
BackgroundPseudo-likelihood methods for community detection in large sparse networks
Amini, A. A., Chen, A., Bickel, P. J., & Levina, E. (2013) · The Annals of Statistics · doi:10.1214/13-aos1138 · Cited by 259
Zeta Functions of Finite Graphs and Representations of $p$-Adic Groups
Hashimoto, K.-I. (2018) · Advanced Studies in Pure Mathematics · doi:10.2969/aspm/01510211 · Cited by 255
Spectra and eigenvectors of scale-free networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review E · doi:10.1103/physreve.64.051903 · Cited by 236
Modularity and Extreme Edges of the Internet
Eriksen, K. A., Simonsen, I., Maslov, S., & Sneppen, K. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.148701 · Cited by 213
Spectra of random graphs with arbitrary expected degrees
Nadakuditi, R. R., & Newman, M. E. J. (2013) · Physical Review E · doi:10.1103/physreve.87.012803 · Cited by 103
Self-citationProceedings of the 6th ACM SIGCOMM conference on Internet measurement
Almeida, J., Brazil, I. I. M. C. 2. R. D. J., Association for Computing Machinery-Digital Library, ACM Special Interest Group on Data Communication, & SIGs, A. (2006) · doi:10.1145/1177080 · Cited by 85
Spectral properties of Google matrix of Wikipedia and other networks
Ermann, L., Frahm, K. M., & Shepelyansky, D. L. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-31090-8 · Cited by 29
Jain, S., Jain, M., & Balasubramani, R. (2019) · IJARCCE · doi:10.17148/ijarcce.2019.8543 · Cited by 11
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Unification of theoretical approaches for epidemic spreading on complex networks
Wang, W., Tang, M., Eugene Stanley, H., & Braunstein, L. A. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa5398 · Cited by 366
Metadata
- Authors
- Martin, T., Zhang, X., & Newman, M. E. J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2014-11-12
- Volume
- 90
- Issue
- 5
- Pages
- 052808-052808
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2058526570
- Cited by
- 309
- References
- 28
- FWCI
- 11.21
- 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.