Author:
Babu Archana,John Sunil Jacob
Abstract
AbstractIn 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.
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Aktas ME, Nguyen T, Riza R, Islam MI, Akbas E (2023) Hypergraph classification via persistent homology. arXiv preprint arXiv:2306.11484
2. Aktas ME, Akbas E, El Fatmaoui A (2019) Persistence homology of networks: methods and applications. Appl Netw Sci 4(1):1–28
3. Alam MT, Ahmed CF, Samiullah M, Leung CK (2021) Mining frequent patterns from hypergraph databases. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 3–15
4. Bandyopadhyay S, Das K, Murty MN (2020) Hypergraph attention isomorphism network by learning line graph expansion. In: 2020 IEEE international conference on big data (Big Data), IEEE, pp 669–678
5. Berge C (1984) Hypergraphs: combinatorics of finite sets, vol 45. Elsevier
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献