Home WakeSpace Scholarship › Electronic Theses and Dissertations

The Friendship Paradox for Weighted and Directed Networks

Electronic Theses and Dissertations

Item Files

Item Details

title
The Friendship Paradox for Weighted and Directed Networks
author
Jiang, Hongyi
abstract
This thesis 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.
subject
configuration model
detailed balance
directed networks
friendship paradox
random walks
weighted networks
contributor
Berenhaut, Kenneth S (committee chair)
Jiang, Miaohua (committee member)
Gemmer, John (committee member)
Hepler, Staci (committee member)
date
2017-08-22T08:35:23Z (accessioned)
2019-08-21T08:30:13Z (available)
2017 (issued)
degree
Mathematics and Statistics (discipline)
embargo
2019-08-21 (terms)
identifier
http://hdl.handle.net/10339/86342 (uri)
language
en (iso)
publisher
Wake Forest University
type
Thesis

Usage Statistics