Homophily is the seemingly ubiquitous tendency for people to connect with
similar others, which is fundamental to how society organizes. Even though many
social interactions occur in groups, homophily has traditionally been measured
from collections of pairwise interactions involving just two individuals. Here,
we develop a framework using hypergraphs to quantify homophily from multiway,
group interactions. This framework reveals that many homophilous group
preferences are impossible; for instance, men and women cannot simultaneously
exhibit preferences for groups where their gender is the majority. This is not
a human behavior but rather a combinatorial impossibility of hypergraphs. At
the same time, our framework reveals relaxed notions of group homophily that
appear in numerous contexts. For example, in order for US members of congress
to exhibit high preferences for co-sponsoring bills with their own political
party, there must also exist a substantial number of individuals from each
party that are willing to co-sponsor bills even when their party is in the
minority. Our framework also reveals how gender distribution in group pictures
varies with group size, a fact that is overlooked when applying graph-based
measures.
Description
[2103.11818] Higher-order Homophily is Combinatorially Impossible
%0 Generic
%1 veldt2021higherorder
%A Veldt, Nate
%A Benson, Austin R.
%A Kleinberg, Jon
%D 2021
%K combinatorics graph homophily hypergraph mathematics triadic
%T Higher-order Homophily is Combinatorially Impossible
%U http://arxiv.org/abs/2103.11818
%X Homophily is the seemingly ubiquitous tendency for people to connect with
similar others, which is fundamental to how society organizes. Even though many
social interactions occur in groups, homophily has traditionally been measured
from collections of pairwise interactions involving just two individuals. Here,
we develop a framework using hypergraphs to quantify homophily from multiway,
group interactions. This framework reveals that many homophilous group
preferences are impossible; for instance, men and women cannot simultaneously
exhibit preferences for groups where their gender is the majority. This is not
a human behavior but rather a combinatorial impossibility of hypergraphs. At
the same time, our framework reveals relaxed notions of group homophily that
appear in numerous contexts. For example, in order for US members of congress
to exhibit high preferences for co-sponsoring bills with their own political
party, there must also exist a substantial number of individuals from each
party that are willing to co-sponsor bills even when their party is in the
minority. Our framework also reveals how gender distribution in group pictures
varies with group size, a fact that is overlooked when applying graph-based
measures.
@misc{veldt2021higherorder,
abstract = {Homophily is the seemingly ubiquitous tendency for people to connect with
similar others, which is fundamental to how society organizes. Even though many
social interactions occur in groups, homophily has traditionally been measured
from collections of pairwise interactions involving just two individuals. Here,
we develop a framework using hypergraphs to quantify homophily from multiway,
group interactions. This framework reveals that many homophilous group
preferences are impossible; for instance, men and women cannot simultaneously
exhibit preferences for groups where their gender is the majority. This is not
a human behavior but rather a combinatorial impossibility of hypergraphs. At
the same time, our framework reveals relaxed notions of group homophily that
appear in numerous contexts. For example, in order for US members of congress
to exhibit high preferences for co-sponsoring bills with their own political
party, there must also exist a substantial number of individuals from each
party that are willing to co-sponsor bills even when their party is in the
minority. Our framework also reveals how gender distribution in group pictures
varies with group size, a fact that is overlooked when applying graph-based
measures.},
added-at = {2022-06-07T14:39:12.000+0200},
author = {Veldt, Nate and Benson, Austin R. and Kleinberg, Jon},
biburl = {https://www.bibsonomy.org/bibtex/238f45ebfd5889d9a2eb00a232d127682/jaeschke},
description = {[2103.11818] Higher-order Homophily is Combinatorially Impossible},
interhash = {c9f8a169d0cbd6a7a405e493454910f1},
intrahash = {38f45ebfd5889d9a2eb00a232d127682},
keywords = {combinatorics graph homophily hypergraph mathematics triadic},
note = {cite arxiv:2103.11818},
timestamp = {2022-06-07T14:39:12.000+0200},
title = {Higher-order Homophily is Combinatorially Impossible},
url = {http://arxiv.org/abs/2103.11818},
year = 2021
}