The generalized friendship paradox for spectral centralities
Journal of Complex Networks · 10.03.2026 · 14 (2)
DOI: 10.1093/comnet/cnag001 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 17.03.2026. Verfasst von Rajat Subhra Hazra und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Netherlands Organisation for Scientific Research.
Abstract (Originalsprache)
We revisit the classical friendship paradox which states that on an average one’s friends have at least as many friends as oneself and generalize it to a variety of network centrality indices. For a broad class of spectral centralities on connected undirected graphs—degree, eigenvector centrality, walk counts, Katz centrality and PageRank, we show that the average centrality of a node’s neighbours always exceeds the global average centrality. We further prove an analogous result for PageRank on strongly connected directed graphs. For degree, this recovers the classical friendship paradox, while for the other centralities it yields new instances of what we call the centrality paradox. We also compare our neighbour-averaged formulation with edge-sampled versions studied previously in the literature.
Förderung
- Netherlands Organisation for Scientific Research
Zitieren
APA
Hazra, R. S., & Verbitskiy, E. (2026). The generalized friendship paradox for spectral centralities. Journal of Complex Networks, 14(2). https://doi.org/10.1093/comnet/cnag001
Vancouver
Hazra RS, Verbitskiy E. The generalized friendship paradox for spectral centralities. Journal of Complex Networks. 2026;14(2). doi:10.1093/comnet/cnag001
BibTeX
@article{Hazra2026,
author = {Hazra, Rajat Subhra and Verbitskiy, Evgeny},
title = {The generalized friendship paradox for spectral centralities},
journal = {Journal of Complex Networks},
year = {2026},
volume = {14},
number = {2},
doi = {10.1093/comnet/cnag001}
}
EUVIMED