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

Journal article : Review

Higher-order interactions are increasingly being recognized as fundamental to our understanding of complex systems, networks, and the development of the next generation of AI algorithms. However, modeling 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: Abiad, A; Arenas, A; Backhausz, Á; Balogh, J; Banerji, CRS

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: IOP Publishing
• Journal: Journal of Physics: Complexity
• Volume: 7
• Issue: 2
• Pages: 022501
• Article number: 022501
• Publication date: 2026-04-01
• Acceptance date: 2026-01-20
• DOI: 10.1088/2632-072x/ae3c4e
• EISSN: 2632-072X
• ISSN: 2632-072X
• Language: English
• Keywords: hypergraphs; triadic interactions; higher-order interactions; simplicity complexes
• Subtype: Review