Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions

Abstract Higher-order interactions are increasingly being recognised as fundamental to our understanding of complex systems, networks, and the development of the next generation of AI algorithms. However, modelling higher-order interactions requires us to go beyond graphs and networks, which can only encode pairwise interactions, and so demands a new theory. Hypergraphs and simplicial complexes (also called higher-order networks), which arise as natural mathematical representations of higher-order complex systems, are therefore attracting increasing attention. The mathematics of higher-order networks is already providing important insights, yet many fundamental mathematical questions remain unsolved; for instance, in spectral graph theory, discrete topology, and higher-order network dynamics. This roadmap summarizes the scientific discussions that took place on these topics between pure mathematicians, theoretical physicists, computer and network scientists at the Newton Institute Satellite meeting on `Hypergraphs: Theory and Applications'. We survey the current state-of-the-art in higher-order network research, and propose some trajectories for future research, including in areas such as extremal and spectral hypergraph theory, discrete topology, higher-order dynamics, higher-order machine learning, and applications in the brain and social sciences.

Authors

Institutions

Publication Details

Journal
Journal of Physics Complexity
Published
2026-01-22
DOI
https://doi.org/10.1088/2632-072x/ae3c4e
Citations
1
Primary Topic
Topological and Geometric Data Analysis
Type
article
Field-Weighted Citation Impact
45.17
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions

Xia Kelin, Cerene. Rathilal, Andrea Civilini, P. L. Krapivsky et al.
1 citations
Journal of Physics Complexity
Topological and Geometric Data Analysis
45.17
article

Hypergraphs and simplicial complexes in focus: A roadmap for future research in higher-order interactions

Xia Kelin, Cerene. Rathilal, Andrea Civilini, P. L. Krapivsky, Christopher R. S. Banerji, Raffaella Mulas, Carolina E. S. Mattsson, Alice Patania, Pedro A. M. Mediano, Tina Eliassi‐Rad, Christian Bick, Sergio Barbarossa, Krystal Guo, Pietro Liò, Juergen Jost, Aida Abiad, Alex Arenas, Ben D. MacArthur, Lucia Cavallaro, Jozsef Balogh, Timoteo Carletti, Martina Scolamiero, Francesco Vaccarino, Yu Tian, Magnus Bakke B Botnan, Michael T Schaub, Ruben Jose Sanchez Garcia, Hanlin Sun, Agnes Backhausz, Xue Gong, Ana Paula Millán, Heather Harrington, Ginestra Bianconi
article en
1 citations

Abstract

Abstract Higher-order interactions are increasingly being recognised as fundamental to our understanding of complex systems, networks, and the development of the next generation of AI algorithms. However, modelling higher-order interactions requires us to go beyond graphs and networks, which can only encode pairwise interactions, and so demands a new theory. Hypergraphs and simplicial complexes (also called higher-order networks), which arise as natural mathematical representations of higher-order complex systems, are therefore attracting increasing attention. The mathematics of higher-order networks is already providing important insights, yet many fundamental mathematical questions remain unsolved; for instance, in spectral graph theory, discrete topology, and higher-order network dynamics. This roadmap summarizes the scientific discussions that took place on these topics between pure mathematicians, theoretical physicists, computer and network scientists at the Newton Institute Satellite meeting on `Hypergraphs: Theory and Applications'. We survey the current state-of-the-art in higher-order network research, and propose some trajectories for future research, including in areas such as extremal and spectral hypergraph theory, discrete topology, higher-order dynamics, higher-order machine learning, and applications in the brain and social sciences.

Journal of Physics Complexity
Eötvös Loránd University (HU), Boston University (US), University of Vermont (US), Nordic Institute for Theoretical Physics (SE), Northeastern University (US), Institute for Scientific Interchange (IT), Radboud University Nijmegen (NL), University of Namur (BE), Queen Mary University of London (GB), Nanyang Technological University (SG), Universidad de Granada (ES), Politecnico di Torino (IT), King's College London (GB), University of Cambridge (GB), Pázmány Péter Catholic University (HU), University of Catania (IT), University of Illinois Chicago (US), Max Planck Institute for Mathematics in the Sciences (DE), Bridge University (SS), Center for Systems Biology Dresden (DE), GGD Amsterdam (NL), Ospedale Santa Corona (IT), University of Southampton (GB), Imperial College London (GB), Universitat Rovira i Virgili (ES), Eindhoven University of Technology (NL), Sapienza University of Rome (IT), Vrije Universiteit Amsterdam (NL), KTH Royal Institute of Technology (SE), University of Amsterdam (NL), RWTH Aachen University (DE), University of KwaZulu-Natal (ZA)
Openalex Percentile: Top 1%
Topological and Geometric Data Analysis
45.17
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.