Back to search

Cornell University

Well-defined graph-theoretic paradoxes

Abstract

dc:description.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't been studied before.

Degree

thesis:*
Name thesis:degree_name
Ph. D., Information Science
Level thesis:degree_level
Doctor of Philosophy
Discipline thesis:degree_discipline
Information Science
Grantor
Cornell University
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Evtushenko, Anna
Chair dc:contributor.chair
  • Kleinberg, Jon
Committee members dc:contributor.committeemember
  • Hobbs, William
  • Macy, Michael

Subjects

dc:subject × 6

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Bibid
16611715
Dc Identifier Other
ProQuest Submission ID: 14462
ProQuest Publication ID: 31483785

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Evtushenko, Anna. Well-defined graph-theoretic paradoxes. Doctor of Philosophy thesis, Cornell University, 2024. https://hdl.handle.net/1813/116444