Friendship Paradox Generalization and Centrality Measures

@article{BenSliman2019FriendshipPG,
  title={Friendship Paradox Generalization and Centrality Measures},
  author={Malek Ben Sliman and Rajeev Kohli},
  journal={Cognition in Mathematics},
  year={2019}
}
The friendship paradox says that on average your friends have more friends than you. Equivalently, in an undirected graph, the average degree of the nodes is no greater than the average degree of the terminal node of a random walk of length one. We generalize this result in two ways: (1) by considering directed graphs, which also allow one-sided relations, such as between followers and leaders; and (2) by characterizing the relations between the expected values of the in and out degrees of the… 
1 Citations

Evaluating stochastic seeding strategies in networks

TLDR
This paper considers contrasts between stochastic seeding strategies and analyze nonparametric estimators adapted from policy evaluation and importance sampling, and uses simulations on real networks to show that the proposed estimators and designs can substantially increase precision while yielding valid inference.