Computing the Homology of Hypergraphs
Algebraic Topology
2018-01-03 v2
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.
Cite
@article{arxiv.1705.00151,
title = {Computing the Homology of Hypergraphs},
author = {Shiquan Ren and Chengyuan Wu and Stephane Bressan and Jie Wu},
journal= {arXiv preprint arXiv:1705.00151},
year = {2018}
}
Comments
We apologize that in the results and algorithms of Section 4.1, Proposition 4.1 and Lemma 4.2, there are some missing conditions and assumptions on the hypergraphs. Hence we want to withdraw the manuscript. Moreover, we want to work out more results, and merge this manuscript together to write a publishable paper