Higher-order rich clubs and configuration models on general directed hypergraphs
Abstract
Detecting structure in complex networks, especially those arising from physical systems, is a central problem across the sciences. One approach is via rich club analysis, which identifies important vertices using a centrality metric and measures whether those vertices are more tightly interconnected than expected by chance. While informative, this approach captures only pairwise interactions, missing out on higher-order ones known to shape the structure and function of many complex systems. We propose a hyper-rich club pipeline that asks whether central vertices are more tightly interconnected than expected by chance through hyperedges encoding higher-order interactions, which also enables the inclusion of important, often omitted, directional information. We work in a broad class of hypergraphs, which we call general directed hypergraphs, that includes as special cases undirected hypergraphs, head-and-tail directed hypergraphs, and totally ordered hypergraphs (a hypergraph related to directed simplicial complexes from topological data analysis). This unifies several non-equivalent notions of directed hypergraph under one definition. On these hypergraphs we define a hyper-rich club framework whose concrete construction depends on explicit choices the domain scientist fixes according to their research goals. Particular choices recover the existing rich club notions for graphs and undirected hypergraphs, and yield the first such notion for each version of directed hypergraphs. We demonstrate that the pipeline recovers meaningful structure in data by studying networks of very different origins: connectomes, temporal networks of infectious spread, networks of poems, and the XGI hypergraph database, in each case detecting structure the standard graph rich club misses.
Related
- Higher-Order Co-Infection on Hypergraphs
- Directed transport of fractional‑order asymmetrically coupled particle chains in ratchet potential
- Higher visual areas act like domain-general filters with strong selectivity and functional specialization
- Higher-order adaptive behaviors outperform pairwise strategies in mitigating contagion dynamics
- Identifiability of a linear dynamical reaction-diffusion system with directed interactions from the second-order statistics of a single snapshot
BibTeX
@misc{smith2026higherorder,
title = {{Higher-order rich clubs and configuration models on general directed hypergraphs}},
author = {Jason P. Smith and Celia Hacker and Jānis Lazovskis and Florian Unger and Keith M. Smith and Daniela Egas Santander},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.01624},
eprint = {2609.01624},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.01624},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Higher-order rich clubs and configuration models on general directed hypergraphs
AU - Jason P. Smith
AU - Celia Hacker
AU - Jānis Lazovskis
AU - Florian Unger
AU - Keith M. Smith
AU - Daniela Egas Santander
PY - 2026
DA - 2026/09/15
PB - arXiv
DO - 10.48550/arxiv.2609.01624
UR - https://arxiv.org/abs/2609.01624
AB - Detecting structure in complex networks, especially those arising from physical systems, is a central problem across the sciences. One approach is via rich club analysis, which identifies important vertices using a centrality metric and measures whether those vertices are more tightly interconnected than expected by chance. While informative, this approach captures only pairwise interactions, missing out on higher-order ones known to shape the structure and function of many complex systems. We propose a hyper-rich club pipeline that asks whether central vertices are more tightly interconnected than expected by chance through hyperedges encoding higher-order interactions, which also enables the inclusion of important, often omitted, directional information. We work in a broad class of hypergraphs, which we call general directed hypergraphs, that includes as special cases undirected hypergraphs, head-and-tail directed hypergraphs, and totally ordered hypergraphs (a hypergraph related to directed simplicial complexes from topological data analysis). This unifies several non-equivalent notions of directed hypergraph under one definition. On these hypergraphs we define a hyper-rich club framework whose concrete construction depends on explicit choices the domain scientist fixes according to their research goals. Particular choices recover the existing rich club notions for graphs and undirected hypergraphs, and yield the first such notion for each version of directed hypergraphs. We demonstrate that the pipeline recovers meaningful structure in data by studying networks of very different origins: connectomes, temporal networks of infectious spread, networks of poems, and the XGI hypergraph database, in each case detecting structure the standard graph rich club misses.
ER -