The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Centrality measures in networks
Abstract
We show that prominent centrality measures in network analysis are all based on additively separable and linear treatments of statistics that capture a node’s position in the network. This enables us to provide a taxonomy of centrality measures that distills them to varying on two dimensions: (i) which information they make use of about nodes’ positions, and (ii) how that information is weighted as a function of distance from the node in question. The three sorts of information about nodes’ positions that are usually used—which we refer to as “nodal statistics”—are the paths from a given node to other nodes, the walks from a given node to other nodes, and the geodesics between other nodes that include a given node. Using such statistics on nodes’ positions, we also characterize the types of trees such that centrality measures all agree, and we also discuss the properties that identify some path-based centrality measures.
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Borgatti, S. P. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.008 · Cited by 3,191
Some Unique Properties of Eigenvector Centrality
Bonacich, P. (2007) · Social Networks · doi:10.1016/j.socnet.2007.04.002 · Cited by 1,572 · cited 1×
“Bonacich (2007) discusses some interesting properties of eigenvector centrality and how it can differ on signed and other networks, which violate these conditions.”
Graphs and Cooperation in Games
Myerson, R. B. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.225 · Cited by 1,446 · cited 1×
“Myerson (1977) adapted the Shapley value to allow for communication structures, Jackson and Wolinsky (1996) adapted the Myerson value to more general network settings, and van den Brink and Gilles (2000) adapted it for power relationships represented by hierarchies and directed networks.”
Social Network Sensors for Early Detection of Contagious Outbreaks
Christakis, N. A., & Fowler, J. H. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012948 · Cited by 535 · cited 1×
“For more background see Wasserman and Faust (1994, Chapter 4), Borgatti (2005), Jackson (2008, Chapter 2.2), and Jackson (2020).6”
BackgroundInfluential
Cited by
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
Huang, C.-H., Tsai, J. J. P., Kurubanjerdjit, N., & Ng, K.-L. (2019) · doi:10.1101/536318 · Cited by 4
Metadata
- Authors
- Bloch, F., Jackson, M. O., & Tebaldi, P.
- Venue
- Social Choice and Welfare
- Published
- 2023-04-24
- Volume
- 61
- Issue
- 2
- Pages
- 413-453
- ISSN
- 0176-1714 (ISSN-L)
- 1432-217X
- OpenAlex
- W3122910277
- Cited by
- 207
- References
- 5
- FWCI
- 19.81
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Centrality measures in networks. https://app.cochat.ai/papers/10.1007/s00355-023-01456-4
- The paper
- Bloch, F., Jackson, M. O., & Tebaldi, P. (2023). Centrality measures in networks. Social Choice and Welfare. https://doi.org/10.1007/s00355-023-01456-4
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.