The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
CENTRALITY ESTIMATION IN LARGE NETWORKS
Open accessAbstract
Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it usually involves solving the single-source shortest-paths (SSSP) problem from every node. Therefore, exact computation is infeasible for many large networks of interest today. Centrality scores can be estimated, however, from a limited number of SSSP computations. We present results from an experimental study of the quality of such estimates under various selection strategies for the source vertices.
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
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
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Bollobás, B. (1985) · Cited by 6,196
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
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
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
A measure of betweenness centrality based on random walks
Newman, M. E. J. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.009 · Cited by 2,461
Gilbert, E. N. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706098 · Cited by 1,122
Centrality in valued graphs: A measure of betweenness based on network flow
Freeman, L. C., Borgatti, S. P., & White, D. R. (1991) · Social Networks · doi:10.1016/0378-8733(91)90017-n · Cited by 1,060
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O., Spencer, J., & Tusnády, G. (2001) · Random Structures & Algorithms · doi:10.1002/rsa.1009 · Cited by 804
(2005) · Lecture Notes in Computer Science · doi:10.1007/b106453 · Cited by 636
An improved index of centrality
Beauchamp, M. A. (1965) · Behavioral Science · doi:10.1002/bs.3830100205 · Cited by 551
Structural parameters of communication networks
Shimbel, A. (1953) · Bulletin of Mathematical Biology · doi:10.1007/bf02476438 · Cited by 498
Eccentricity and centrality in networks
Hage, P., & Harary, F. (1995) · Social Networks · doi:10.1016/0378-8733(94)00248-9 · Cited by 497
Structural analysis of hypertexts: identifying hierarchies and useful metrics
Botafogo, R. A., Rivlin, E., & Shneiderman, B. (1992) · ACM Transactions on Information Systems · doi:10.1145/146802.146826 · Cited by 421
Centrality Measures Based on Current Flow
Brandes, U., & Fleischer, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31856-9_44 · Cited by 333
Self-citationKoschützki, D., Lehmann, K. A., Peeters, L., Richter, S., Tenfelde-Podehl, D., & Zlotowski, O. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31955-9_3 · Cited by 286
Anthonisse, J. M. (1971) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 277
Studying Complex Discursive Systems..: Centering Resonance Analysis of Communication
Corman, S. R., Kuhn, T., Mcphee, R. D., & Dooley, K. J. (2002) · Human Communication Research · doi:10.1111/j.1468-2958.2002.tb00802.x · Cited by 274
Satellite exchange in the Baltimore Needle Exchange Program.
Valente, T. W., Foreman, R. K., Junge, B., & Vlahov, D. (1998) · PubMed Central · Cited by 66
Cited by
On variants of shortest-path betweenness centrality and their generic computation
Brandes, U. (2008) · Social Networks · doi:10.1016/j.socnet.2007.11.001 · Cited by 989
Self-citationRanking of Closeness Centrality for Large-Scale Social Networks
Okamoto, K., Chen, W., & Li, X.-Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69311-6_21 · Cited by 378
Approximating Betweenness Centrality
Bader, D. A., Kintali, S., Madduri, K., & Mihail, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_10 · Cited by 340
Metadata
- Authors
- BRANDES, U., & PICH, C.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Ltd
- Published
- 2007-07
- Volume
- 17
- Issue
- 07
- Pages
- 2303-2318
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W1996014455
- Cited by
- 384
- References
- 26
- FWCI
- 6.92
- 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.