Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T05:31:11.300Z Has data issue: false hasContentIssue false

THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS

Published online by Cambridge University Press:  18 September 2018

Kenneth S. Berenhaut
Affiliation:
Department of Mathematics and Statistics, Wake Forest University, 1834 Wake Forest Road, Winston Salem, NC, USA E-mails: berenhks@wfu.edu; jianh15@wfu.edu
Hongyi Jiang
Affiliation:
Department of Mathematics and Statistics, Wake Forest University, 1834 Wake Forest Road, Winston Salem, NC, USA E-mails: berenhks@wfu.edu; jianh15@wfu.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2018