Every finite tree has at least as many positive as negative friendship-bias vertices, with an explicit gap bound, and infinite Galton-Watson trees have computable densities of all three vertex types.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The friendship paradox for trees
Every finite tree has at least as many positive as negative friendship-bias vertices, with an explicit gap bound, and infinite Galton-Watson trees have computable densities of all three vertex types.