Centrality-friendship paradoxes: when our friends are more important than us

DOI10.1093/COMNET/CNY029MaRDI QIDQ4958768zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 15 September 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1807.01496

zbMATH Keywords

matrix functionPerron-Frobenius theoryeigenvector centralitysampling biaswalkKatz centralityfriendship paradox

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Social networks; opinion dynamics (91D30) Vertex degrees (05C07)

Abstract: The friendship paradox states that, on average, our friends have more friends than we do. In network terms, the average degree over the nodes can never exceed the average degree over the neighbours of nodes. This effect, which is a classic example of sampling bias, has attracted much attention in the social science and network science literature, with variations and extensions of the paradox being defined, tested and interpreted. Here, we show that a version of the paradox holds rigorously for eigenvector centrality: on average, our friends are more important than us. We then consider general matrix-function centrality, including Katz centrality, and give sufficient conditions for the paradox to hold. We also discuss which results can be generalized to the cases of directed and weighted edges. In this way, we add theoretical support for a field that has largely been evolving through empirical testing.

Recommendations

• The friendship paradox in real and model networks
• The multistep friendship paradox
• The friendship paradox
• THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
• Weighted averages and the friendship paradox

Cited in

(9)

• Principal eigenvector of the signless Laplacian matrix
• Copula-based analysis of the generalized friendship paradox in clustered networks
• The multistep friendship paradox
• Weighted averages and the friendship paradox
• The friendship paradox in real and model networks
• The friendship paradox
• THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
• Asymptotic distribution of the friendship paradox of a random geometric graph
• Measuring the variability of local characteristics in complex networks: empirical and analytical analysis

This page was built for publication: Centrality-friendship paradoxes: when our friends are more important than us

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958768)