<?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-20T03:14:48Z</responseDate><request verb="GetRecord" identifier="oai:wakespace.lib.wfu.edu:10339/82258" metadataPrefix="dim">https://wakespace.lib.wfu.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:null:10339/82258</identifier><datestamp>2026-09-16T09:38:30Z</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">Kotsonis, Rebecca</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-06-15T08:36:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2019-06-14T08:30:12Z</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/82258</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis, we propose a new method for studying local and global clustering in networks employing random walk pairs. The method is intuitive and directly generalizes standard local and global clustering coefficients to weighted networks and networks containing nodes of multiple types. In the case of two-mode networks, the values obtained for commonly considered social networks are in sharp contrast to those obtained by previous methods, and provide a different viewpoint for clustering. The approach is also applicable in questions related to the general study of segregation and homophily. Applications to existent data sets 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">Clustering coefficient</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">geodesic distance</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">multi-faction networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Multiple random walks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">two-mode networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">weighted networks</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A New Look at Clustering Coefficients with Generalization to Weighted and Multi-Faction 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">Erhardt, Robert J</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeMember" lang="en_US">Hepler, Staci A</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-06-14</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>