Neither graphs nor hypergraphs: structural moments of higher-order interactions determine stochastic social-impact dynamics

Whether higher-order interactions can be reduced to simpler representations is a question about the dynamics they drive, not only about their structure: what can be discarded is whatever the dynamics does not see. We make this precise for binary-state stochastic dynamics in which each agent, when updated, interacts with a randomly selected group and changes state according to the fraction of disagreeing members, as in generalized voter and social-impact models on hypergraphs. We ask which statistics of the group-interaction process determine the resulting Markov dynamics. For response functions that are polynomials of degree $q$, the answer is a hierarchy of size-weighted inclusion moments, which we call structural moments, involving at most $q$ neighbors at a time, regardless of how large the groups are. These moments are not only sufficient but also necessary: two interaction structures produce identical dynamics for all such rules if and only if their moments coincide. More generally, each class of rules selects its own minimal structural description, ranging from weighted pairwise links for linear rules to the full distribution of co-membership by group size for arbitrary rules. For voter-type rules, the same moments also reconstruct exact pairwise copying representations of these dynamics.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24252
Primary Topic
Opinion Dynamics and Social Influence
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Neither graphs nor hypergraphs: structural moments of higher-order interactions determine stochastic social-impact dynamics

Emanuele Cozzo
arXiv (Cornell University)
Opinion Dynamics and Social Influence
preprint

Neither graphs nor hypergraphs: structural moments of higher-order interactions determine stochastic social-impact dynamics

Emanuele Cozzo
preprint en

Abstract

Whether higher-order interactions can be reduced to simpler representations is a question about the dynamics they drive, not only about their structure: what can be discarded is whatever the dynamics does not see. We make this precise for binary-state stochastic dynamics in which each agent, when updated, interacts with a randomly selected group and changes state according to the fraction of disagreeing members, as in generalized voter and social-impact models on hypergraphs. We ask which statistics of the group-interaction process determine the resulting Markov dynamics. For response functions that are polynomials of degree $q$, the answer is a hierarchy of size-weighted inclusion moments, which we call structural moments, involving at most $q$ neighbors at a time, regardless of how large the groups are. These moments are not only sufficient but also necessary: two interaction structures produce identical dynamics for all such rules if and only if their moments coincide. More generally, each class of rules selects its own minimal structural description, ranging from weighted pairwise links for linear rules to the full distribution of co-membership by group size for arbitrary rules. For voter-type rules, the same moments also reconstruct exact pairwise copying representations of these dynamics.

arXiv (Cornell University)
Opinion Dynamics and Social Influence
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon