Article contents
THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
Published online by Cambridge University Press: 18 September 2018
Abstract
This paper studies the friendship paradox for weighted and directed networks, from a probabilistic perspective. We consolidate and extend recent results of Cao and Ross and Kramer, Cutler and Radcliffe, to weighted networks. Friendship paradox results for directed networks are given; connections to detailed balance are considered.
Keywords
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 33 , Issue 1 , January 2019 , pp. 136 - 145
- Copyright
- Copyright © Cambridge University Press 2018
References
- 5
- Cited by