A comprehensive generalization of the Friendship Paradox to weights and attributes
<|reference_start|>A comprehensive generalization of the Friendship Paradox to weights and attributes: The Friendship Paradox is a simple and powerful statement about node degrees in a graph (Feld 1991). However, it only applies to undirected graphs with no edge weights, and the only node characteristic it concerns is degree. Since many social networks are more complex than that, it is useful to generalize this phenomenon, if possible, and a number of papers have proposed different generalizations. Here, we unify these generalizations in a common framework, retaining the focus on undirected graphs and allowing for weighted edges and for numeric node attributes other than degree to be considered, since this extension allows for a clean characterization and links to the original concepts most naturally. While the original Friendship Paradox and the Weighted Friendship Paradox hold for all graphs, considering non-degree attributes actually makes the extensions fail around 50% of the time, given random attribute assignment. We provide simple correlation-based rules to see whether an attribute-based version of the paradox holds. In addition to theory, our simulation and data results show how all the concepts can be applied to synthetic and real networks. Where applicable, we draw connections to prior work to make this an accessible and comprehensive paper that lets one understand the math behind the Friendship Paradox and its basic extensions.<|reference_end|>
@article{evtushenko2024a,
    title={A comprehensive generalization of the Friendship Paradox to weights and
  attributes},
    author={Anna Evtushenko, Jon Kleinberg},
    journal={Sci Rep 14, 13730 (2024)},
    year={2024},
    doi={10.1038/s41598-024-63167-9},
    archivePrefix={arXiv},
    eprint={2406.10423},
    primaryClass={cs.SI cs.DM math.CO}
}