<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T10:41:29Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/116444" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/116444</identifier><datestamp>2026-05-15T19:44:04Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</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">Evtushenko, Anna</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Kleinberg, Jon</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Hobbs, William</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Macy, Michael</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-01-14T19:59:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-01-14T19:59:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 14462</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 31483785</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/116444</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/77jy-fp52</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16611715</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">159 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Some network phenomena, like the small-world property, are applicable only for certain types of networks, e.g. social networks, and often need to be confirmed empirically. The Friendship Paradox, despite its name, works for all graphs regardless of domain and nature. This dissertation introduces a comprehensive generalization of the Friendship Paradox to edge weights and numerical node attributes and also introduces the Homophily Paradox, which is conceptually similar to the Friendship Paradox, but is also qualitatively different and hasn't been studied before.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">computational sociology</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">friendship paradox</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">homophily</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">paradox</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Well-defined graph-theoretic paradoxes</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/16611715</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Information Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Information Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Evtushenko, Anna</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2d522c82-9cad-4cc8-8975-dd7a63054e25">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>Well-defined graph-theoretic paradoxes&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/77jy-fp52&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Evtushenko, Anna&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>computational sociology&lt;/Keyword>
    &lt;Keyword>friendship paradox&lt;/Keyword>
    &lt;Keyword>graph theory&lt;/Keyword>
    &lt;Keyword>homophily&lt;/Keyword>
    &lt;Keyword>networks&lt;/Keyword>
    &lt;Keyword>paradox&lt;/Keyword>
   	&lt;Abstract>Some network phenomena, like the small-world property, are applicable only for certain types of networks, e.g. social networks, and often need to be confirmed empirically. The Friendship Paradox, despite its name, works for all graphs regardless of domain and nature. This dissertation introduces a comprehensive generalization of the Friendship Paradox to edge weights and numerical node attributes and also introduces the Homophily Paradox, which is conceptually similar to the Friendship Paradox, but is also qualitatively different and hasn&amp;apos;t been studied before.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>