Hyperbolic embedding of higher-order simplicial networks
Abstract
Many biological interactions involve groups rather than pairs, as when several proteins assemble into a multi-protein complex. Simplicial complexes naturally capture these collective interactions. Existing hyperbolic embeddings represent network hierarchy and similarity through a few interpretable coordinates, but rely only on pairwise links: they cannot distinguish three units engaged in a common interaction from three units connected only in pairs. We introduce here the hyperbolic higher-order (HHO) embedding, which embeds a simplicial complex into the Poincaré disk, while incorporating its group interactions. The hyperbolic area of the triangle spanned by three interacting nodes then measures how compactly their interaction is represented. Testson synthetic and real-world networks, including a co-authorship network and the protein interaction network of \textit{Escherichia coli}, show that HHO reduces the hyperbolic area of triangles representing simplices relative to those obtained from pairwise network embeddings. HHO also recovers node groups more accurately than pairwise embeddings and a weighted-clique alternative, with performance competitive with Euclidean embeddings, while providing a low-dimensional representation that can be analyzed with the tools of network geometry.
Related
- Classification of strongly non-hyperbolic critical points of planar second-order chemical reaction systems
- Higher-order adaptive behaviors outperform pairwise strategies in mitigating contagion dynamics
- Higher-order metabolic interactions among oral commensals gate pathobiont expansion through succinate-driven pH modulation
- Do higher-order moments improve inference of population dynamics?
- Capsid-specialized protein language models reveal higher-order viral architecture from sequence
BibTeX
@misc{guillemaud2026hyperbolic,
title = {{Hyperbolic embedding of higher-order simplicial networks}},
author = {Martin Guillemaud and Vito Latora and Mario Chavez},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41684},
eprint = {2610.41684},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41684},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Hyperbolic embedding of higher-order simplicial networks
AU - Martin Guillemaud
AU - Vito Latora
AU - Mario Chavez
PY - 2026
DA - 2026/10/30
PB - arXiv
DO - 10.48550/arxiv.2610.41684
UR - https://arxiv.org/abs/2610.41684
AB - Many biological interactions involve groups rather than pairs, as when several proteins assemble into a multi-protein complex. Simplicial complexes naturally capture these collective interactions. Existing hyperbolic embeddings represent network hierarchy and similarity through a few interpretable coordinates, but rely only on pairwise links: they cannot distinguish three units engaged in a common interaction from three units connected only in pairs. We introduce here the hyperbolic higher-order (HHO) embedding, which embeds a simplicial complex into the Poincaré disk, while incorporating its group interactions. The hyperbolic area of the triangle spanned by three interacting nodes then measures how compactly their interaction is represented. Testson synthetic and real-world networks, including a co-authorship network and the protein interaction network of \textit{Escherichia coli}, show that HHO reduces the hyperbolic area of triangles representing simplices relative to those obtained from pairwise network embeddings. HHO also recovers node groups more accurately than pairwise embeddings and a weighted-clique alternative, with performance competitive with Euclidean embeddings, while providing a low-dimensional representation that can be analyzed with the tools of network geometry.
ER -