Friendship paradox disappears under degree biased network sampling

Wojciech Roga

We show that in an undirected graph under degree biased sampling the expected degree of vertices is equal to the expected degree of their neighbors. In consequence, under the biase…