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.
From: Azadeh Parvaneh [view email]
[v1]
Tue, 27 May 2025 21:18:18 UTC (358 KB)
[v2]
Fri, 24 Jul 2026 10:10:04 UTC (360 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。