Hypergraph co-optimal transport: metric and categorical properties
From MaRDI portal
Publication:6650214
DOI10.1007/s41468-023-00142-9MaRDI QIDQ6650214
Tom Needham, Ethan Semrad, Youjia Zhou, Bei Wang, Samir Chowdhury
Publication date: 6 December 2024
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Persistent homology and applications, topological data analysis (55N31) Metric geometry (51F99) Categories of networks and processes, compositionality (18M35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of general hypergraphs
- A spectral notion of Gromov-Wasserstein distance and related methods
- A category-theoretical approach to hypergraphs
- Gromov-Wasserstein distances and the metric approach to object matching
- Line graphs of hypergraphs. I
- Functorial hierarchical clustering with overlaps
- Hypergraph theory. An introduction
- Classifying clustering schemes
- Explicit geodesics in Gromov-Hausdorff space
- Hierarchical clustering of asymmetric networks
- On the geometry of metric measure spaces. I
- Six theorems about injective metric spaces
- Numerical Geometry of Non-Rigid Shapes
- An eigendecomposition approach to weighted graph matching problems
- Bilinear programming: An exact algorithm
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- Multiscale Mapper: Topological Summarization via Codomain Covers
- Bipolar metric spaces and some fixed point theorems
- The Gromov–Wasserstein distance between networks and stable network invariants
- Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach
- Application of hypergraph theory in chemistry
This page was built for publication: Hypergraph co-optimal transport: metric and categorical properties
