Persistent homology based Bottleneck distance in hypergraph products

Abstract In this paper, we extended the technique of measuring similarity between topological spaces using bottle neck distance between persistence diagrams to hypergraph networks. Finding a relationship between the bottleneck distance of the Cartesian product of topological spaces and the bottleneck distance of individual spaces, we are trying to ease the comparative study of the Cartesian product of topological spaces. The Cartesian product and the strong product of weighted hypergraphs are defined, and the relationship between the bottleneck distance between hypergraph products and the bottleneck distance between individual hypergraphs is determined. For this, clique complex filtration and the Vietoris–Rips filtration in unweighted and weighted hypergraphs are defined and used.