The friendship paradox for sparse random graphs

Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh

Let $G_n$ be an undirected finite graph on $n\in \mathbb{N}$ vertices labelled by $[n]=\{1,\dots ,n\}$. For $i\in [n]$, let ${\Delta }_{i,n}$ be the friendship bias of vertex $i$, define…