Evidence map›Paper›PMID 41540038›Full record

ArticleNature communications2026

Reducibility of higher-order networks from dynamics.

Maxime Lucas, Luca Gallo, Arsham Ghavasieh, Federico Battiston, Manlio De Domenico

Abstract read
In one paragraph

Article in Nature communications, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Hypergraph reconstruction from dynamics.Nature communications · 2025
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Maxime LucasDepartment of Mathematics and Namur Institute for Complex Systems (naXys), Université de Namur, Namur, Belgium. maxime.lucas@unamur.be.ORCID http://orcid.org/0000-0001-8087-2981
Luca GalloDepartment of Network and Data Science, Central European University, Vienna, Austria.ORCID http://orcid.org/0000-0002-2160-8467
Arsham GhavasiehDepartment of Physics and Astronomy "Galileo Galilei", University of Padua, Padova, Italy.ORCID http://orcid.org/0000-0001-8138-7208
Federico Battiston *Department of Network and Data Science, Central European University, Vienna, Austria.ORCID http://orcid.org/0000-0001-9646-6232
Manlio De Domenico *Department of Physics and Astronomy "Galileo Galilei", University of Padua, Padova, Italy.ORCID http://orcid.org/0000-0001-5158-8594

Funding

Austrian Science Fund (Fonds zur Förderung der Wissenschaftlichen Forschung) 10.55776/PAT1052824Austrian Science Fund (Fonds zur Förderung der Wissenschaftlichen Forschung) 10.55776/PAT1652425United States Department of Defense | United States Air Force | AFMC | Air Force Office of Scientific Research (AF Office of Scientific Research) FA8655-22-1-7025
6 · The paper itself

Abstract

Empirical complex systems can be characterized not only by pairwise interactions, but also by higher-order (group) interactions influencing collective phenomena, from metabolic reactions to epidemics. Nevertheless, higher-order networks' apparent superior descriptive power-compared to classical pairwise networks-comes with a much increased model complexity and computational cost, challenging their application. Consequently, it is of paramount importance to establish a quantitative method to determine when such a modeling framework is advantageous with respect to pairwise models, and to which extent it provides a valuable description of empirical systems. Here, we propose an information-theoretic framework, accounting for how structures affect diffusion behaviors, quantifying the entropic cost and distinguishability of higher-order interactions to assess their reducibility to lower-order structures while preserving relevant functional information. Empirical analyses indicate that some systems retain essential higher-order structure, whereas in some technological and biological networks it collapses to pairwise interactions. With controlled randomization procedures, we investigate the role of nestedness and degree heterogeneity in this reducibility process. Our findings contribute to ongoing efforts to minimize the dimensionality of models for complex systems.

Identifiers

PMID41540038
PMCPMC12894711

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.