<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-20T02:41:42Z</responseDate><request verb="GetRecord" identifier="oai:wakespace.lib.wfu.edu:10339/86342" metadataPrefix="dim">https://wakespace.lib.wfu.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:null:10339/86342</identifier><datestamp>2026-09-02T15:34:45Z</datestamp><setSpec>com_10339_14934</setSpec><setSpec>col_10339_38132</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Jiang, Hongyi</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-08-22T08:35:23Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2019-08-21T08:30:13Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://wakespace.lib.wfu.edu/handle/10339/86342</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Wake Forest University</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">configuration model</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">detailed balance</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">directed networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">friendship paradox</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">random walks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">weighted networks</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">The Friendship Paradox for Weighted and Directed Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeChair" lang="en_US">Berenhaut, Kenneth S</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeMember" lang="en_US">Jiang, Miaohua</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeMember" lang="en_US">Gemmer, John</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeMember" lang="en_US">Hepler, Staci</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline" lang="en_US">Mathematics and Statistics</dim:field>
   <dim:field mdschema="thesis" element="embargo" qualifier="terms" lang="en_US">2019-08-21</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>