Computing the Homology of Hypergraphs
Shiquan Ren, Chengyuan Wu, Stephane Bressan, Jie Wu
TL;DR
This paper introduces algorithms and heuristics for efficiently computing the homology of hypergraphs, which are important for understanding their topological properties in network analysis.
Contribution
It presents new algorithms and heuristics specifically designed for computing the homology of hypergraphs and their associated simplicial complexes.
Findings
Algorithms for homology computation are developed.
Heuristics improve computational efficiency.
Applications to topological analysis of hypergraphs.
Abstract
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to compute the homology of the associated simplicial complexes and the embedded homology of hypergraphs as well as some heuristics for efficient computations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Data Visualization and Analytics