Papers › Identifying maximal sets of significantly interacting nodes in higher-order networks
Identifying maximal sets of significantly interacting nodes in higher-order networks
Lorenzo Betti, Federico Musciotto, Federico Battiston, Rosario N. Mantegna
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Filtering methods are fundamental tools for extracting the backbone of complex networks. Systems displaying group interactions, however, open the way to new types of filtering approaches. Here, we introduce a statistical filtering method for higher-order networks that identifies statistically validated maximal interacting sets -- maximal sets of nodes that consistently interact together within group interactions. Using properly designed benchmarks, we show that our approach is highly effective in systems where the maximal sets are likely to be diluted into interactions of larger sizes that include occasional participants. Applications to real-world data reveal that the identified sets of nodes are characterized by higher levels of similarity and topical coherence, highlighting the ability of our method to provide new insights on the organization of real-world higher-order networks.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections