{"ID":2893499,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.13059","arxiv_id":"2507.13059","title":"The Generalized Friendship Paradox for Spectral Centralities","abstract":"We revisit the classical friendship paradox which states that on an average ones 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 nodes neighbours always exceeds the global average centrality.","short_abstract":"We revisit the classical friendship paradox which states that on an average ones 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 cent...","url_abs":"https://arxiv.org/abs/2507.13059","url_pdf":"https://arxiv.org/pdf/2507.13059v2","authors":"[\"Rajat Subhra Hazra\",\"Evgeny Verbitskiy\"]","published":"2025-07-17T12:28:42Z","proceeding":"cs.SI","tasks":"[\"cs.SI\",\"math.PR\"]","methods":"[]","has_code":false}