Metraipolis › archive › dc_e452280dd59d

Keeping the interaction structure explicit: comment on ''Graphs are maximally expressive for higher-order interactions" — arXiv:2610.08712

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08712
License (as archived)
CC0-1.0
Archived
2026-10-07T17:06:34.903Z
SHA-256 of the archived text
ed8773947e014b35dc8b1d5df7148a1875608bbd079289453c8c4d37f2a1aff4
Stable URL of this page
https://metraipolis.com/documento/dc_e452280dd59d

How to cite

Keeping the interaction structure explicit: comment on ''Graphs are maximally expressive for higher-order interactions" — arXiv:2610.08712 — arXiv (en), https://arxiv.org/abs/2610.08712 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e452280dd59d (Metraipolis archive dc_e452280dd59d, sha256 ed8773947e014b35dc8b1d5df7148a1875608bbd079289453c8c4d37f2a1aff4)
BibTeX
@misc{dce452280dd59d,
  title = {Keeping the interaction structure explicit: comment on ''Graphs are maximally expressive for higher-order interactions" — arXiv:2610.08712},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08712},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e452280dd59d; sha256 ed8773947e014b35dc8b1d5df7148a1875608bbd079289453c8c4d37f2a1aff4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08712. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Peixoto et al. ( arXiv:2602.16937v2 ) stress that graph-based formulations can express any interaction model, a point the literature on higher-order networks (HONs) has often overlooked. We agree with much of their critique. We argue that expressiveness, however, might not be the main reason hypergraphs are often preferred. A network is read from a model rather than assumed, and to properly study the role of structure-one of the most basic questions in complex systems research-one needs a representation that keeps that structure separate from the functional form of the interactions. We show that such representation is in general a directed hypergraph (equivalently, a directed factor graph), with one hyperarc per interaction term, recovering a (directed) graph for pairwise interactions, and an undirected hypergraph for symmetric, higher-order ones. Most of the HONs literature have focused so far on symmetric interactions, which, in light of what established here, might explain why there (undirected) hypergraphs are regularly presented as the natural representation for systems with higher-order interactions.

Tema degli esploratori: governance digitale e beni comuni (elenco arXiv physics.soc-ph, nuovi lavori del giorno).
Categorie arXiv: Physics and Society (physics.soc-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.08712 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T16:36:29.960Z dalla pagina https://arxiv.org/list/physics.soc-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).