Friendship paradox disappears under degree biased network sampling
This paper demonstrates that degree-biased sampling in undirected graphs eliminates the friendship paradox by ensuring the expected degree of sampled vertices equals the expected degree of their neighbors, a condition equivalent to the stationary state of a random walk or the conservation of total flow.