2000 character limit reached
Computing the Homology of Hypergraphs
Published 29 Apr 2017 in math.AT | (1705.00151v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.