The friendship paradox for trees
Abstract
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of positive vertices is at least as large as the number of negative vertices, a property we refer to as significance, and derive a lower bound in terms of the branching points in the tree. For an infinite Galton-Watson tree, we compute the densities of the positive and the negative vertices and show that either may dominate the other, depending on the offspring distribution. We also compute the densities of the edges having two given types of vertices at their ends, and give conditions in terms of the offspring distribution under which these types are positively or negatively correlated.
Keywords
Cite
@article{arxiv.2505.21774,
title = {The friendship paradox for trees},
author = {Rajat Subhra Hazra and Frank den Hollander and Nelly Litvak and Azadeh Parvaneh},
journal= {arXiv preprint arXiv:2505.21774},
year = {2025}
}