EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Hyperedge approximation for stochastic processes on higher-order networks

Anzhi Sheng iD, Alex McAvoy iD, Ye Tian iD, Silun Zhang, Angela Fontan iD, Joshua B Plotkin iD

Proceedings of the National Academy of Sciences · 11.08.2026 · 123 (32)

DOI: 10.1073/pnas.2619078123 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, online erschienen am 05.08.2026. Verfasst von Anzhi Sheng und 5 weiteren Autor:innen. Beteiligte Einrichtung: Department of Decision and Control Systems, KTH Royal Institute of Technology, Stockholm 10044, Sweden. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 57 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graphs provide a natural framework to describe processes shaped by pairwise interactions among agents. But many dynamical systems involve interactions within groups of three or more agents. Here, we develop the “ ℓ -hyperedge approximation,” an analytical framework for stochastic processes on regular hypergraphs, in which each individual belongs to k groups of size ℓ . The framework accommodates both higher-order interactions that determine payoffs and higher-order processes for updating states in response to payoffs. For evolutionary games on hypergraphs, our analysis generalizes the classical b / c > k rule for cooperation to the ℓ -player donation game; and it yields critical benefit-to-cost ratios for the nonlinear ℓ -player public goods game, which remains bounded as the degree grows. Applied to neutral complex contagions, where inheritance of states occurs within hyperedges rather than along parent–offspring edges, the framework gives a closed-form fixation probability, showing how a single complexity parameter governs the spread of rare types. Coupling the two processes produces a unified stochastic model of payoff-biased complex contagions in structured populations. Together, these results extend pair approximation from graphs to hypergraphs, accommodating multiway interactions and group-level inheritance with no pairwise analog.

Schlagwörter

Stichwörter der Autor:innen

complex contagionevolutionary game dynamicshigher-order interactionsstatistical physics

Autor:innen und Institutionen

  • Department of Decision and Control Systems, KTH Royal Institute of Technology, Stockholm 10044, Sweden.
  • Department of Mathematics, KTH Royal Institute of Technology, Stockholm 10044, Sweden.
  • Department of Biology, University of Pennsylvania, Philadelphia, PA 19104.
  • School of Data Science and Society, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599.
  • Department of Mathematics, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599.
  • Center for Mathematical Biology, University of Pennsylvania, Philadelphia, PA 19014.

ORCID-Profile: Anzhi Sheng, Alex McAvoy, Ye Tian, Angela Fontan, Joshua B Plotkin

Zitieren

APA

Sheng, A., McAvoy, A., Tian, Y., Zhang, S., Fontan, A., & Plotkin, J. B. (2026). Hyperedge approximation for stochastic processes on higher-order networks. Proceedings of the National Academy of Sciences, 123(32). https://doi.org/10.1073/pnas.2619078123

Vancouver

Sheng A, McAvoy A, Tian Y, Zhang S, Fontan A, Plotkin JB. Hyperedge approximation for stochastic processes on higher-order networks. Proceedings of the National Academy of Sciences. 2026;123(32). doi:10.1073/pnas.2619078123

BibTeX
@article{Sheng2026,
  author = {Sheng, Anzhi and McAvoy, Alex and Tian, Ye and Zhang, Silun and Fontan, Angela and Plotkin, Joshua B},
  title = {Hyperedge approximation for stochastic processes on higher-order networks},
  journal = {Proceedings of the National Academy of Sciences},
  year = {2026},
  volume = {123},
  number = {32},
  doi = {10.1073/pnas.2619078123}
}
Kostenlos starten →