Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Topological Optimal Transport for Geometric Cycle Matching (2403.19097v1)

Published 28 Mar 2024 in math.AT, cs.CG, and math.MG

Abstract: Topological data analysis is a powerful tool for describing topological signatures in real world data. An important challenge in topological data analysis is matching significant topological signals across distinct systems. In geometry and probability theory, optimal transport formalises notions of distance and matchings between distributions and structured objects. We propose to combine these approaches, constructing a mathematical framework for optimal transport-based matchings of topological features. Building upon recent advances in the domains of persistent homology and optimal transport for hypergraphs, we develop a transport-based methodology for topological data processing. We define measure topological networks, which integrate both geometric and topological information about a system, introduce a distance on the space of these objects, and study its metric properties, showing that it induces a geodesic metric space of non-negative curvature. The resulting Topological Optimal Transport (TpOT) framework provides a transport model on point clouds that minimises topological distortion while simultaneously yielding a geometrically informed matching between persistent homology cycles.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (57)
  1. Gradient flows: in metric spaces and in the space of probability measures. Springer Science & Business Media, 2005.
  2. Hypergraphs for multiscale cycles in structured data. arXiv preprint arXiv:2210.07545, 2022.
  3. Induced matchings and the algebraic stability of persistence barcodes. arXiv preprint arXiv:1311.3681, 2013.
  4. A course in metric geometry, volume 33. American Mathematical Society, 2022.
  5. Measuring and computing natural generators for homology groups. Computational Geometry, 43:169–181, 02 2010.
  6. Samir Chowdhury. Geodesics in persistence diagram space. arXiv preprint arXiv:1905.10820, 2019.
  7. Explicit geodesics in gromov-hausdorff space. arXiv preprint arXiv:1603.02385, 2016.
  8. The Gromov–Wasserstein distance between networks and stable network invariants. Information and Inference: A Journal of the IMA, 8(4):757–787, 2019.
  9. Quantized gromov-wasserstein. In Machine Learning and Knowledge Discovery in Databases. Research Track: European Conference, ECML PKDD 2021, Bilbao, Spain, September 13–17, 2021, Proceedings, Part III 21, pages 811–827. Springer, 2021.
  10. Gromov-Wasserstein averaging in a Riemannian framework. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, pages 842–843, 2020.
  11. Hypergraph co-optimal transport: Metric and categorical properties. Journal of Applied and Computational Topology, pages 1–60, 2023.
  12. Stability of persistence diagrams. In Proceedings of the twenty-first annual symposium on Computational geometry, pages 263–271, 2005.
  13. Persistent homology for kernels, images, and cokernels. In Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, pages 1011–1020. SIAM, 2009.
  14. Matija Čufar. Ripserer.jl: flexible and efficient persistent homology computation in julia. Journal of Open Source Software, 5(54):2614, 2020.
  15. Fast computation of persistent homology representatives with involuted persistent homology. arXiv preprint arXiv:2105.03629, 2021.
  16. Persistent 1-cycles: Definition, computation, and its application. In International Workshop on Computational Topology in Image Context, pages 123–136. Springer, 2019.
  17. Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport. Journal of Applied and Computational Topology, 5:1–53, 2021.
  18. Computational topology: an introduction. American Mathematical Soc., 2010.
  19. Multiscale topology of chromatin folding. arXiv preprint arXiv:1511.01426, 2015.
  20. Pot: Python optimal transport. J. Mach. Learn. Res., 22(78):1–8, 2021.
  21. Fast topological signal identification and persistent cohomological cycle matching. arXiv preprint arXiv:2209.15446, 2022.
  22. Robert Ghrist. Barcodes: the persistent topology of data. Bulletin of the American Mathematical Society, 45(1):61–75, 2008.
  23. Signatures, lipschitz-free spaces, and paths of persistence diagrams. SIAM Journal on Applied Algebra and Geometry, 7(4):828–866, 2023.
  24. Curvature sets over persistence diagrams. arXiv preprint arXiv:2103.04470, 2021.
  25. Basis-independent partial matchings induced by morphisms between persistence modules. arXiv preprint arXiv:2006.11100, 2020.
  26. Metric structures for Riemannian and non-Riemannian spaces, volume 152. Springer, 1999.
  27. Topological node2vec: Enhanced graph embedding via persistent homology. arXiv preprint arXiv:2309.08241, 2023.
  28. Large scale computation of means and clusters for persistence diagrams using optimal transport. Advances in Neural Information Processing Systems, 31, 2018.
  29. Minimal cycle representatives in persistent homology using linear programming: An empirical study with user’s guide. Frontiers in Artificial Intelligence, 4, 2021.
  30. Flexible and probabilistic topology tracking with partial optimal transport. arXiv preprint arXiv:2302.02895, 2023.
  31. Facundo Mémoli. On the use of Gromov-Hausdorff Distances for Shape Comparison. In M. Botsch, R. Pajarola, B. Chen, and M. Zwicker, editors, Eurographics Symposium on Point-Based Graphics. The Eurographics Association, 2007.
  32. Facundo Mémoli. Gromov–wasserstein distances and the metric approach to object matching. Foundations of computational mathematics, 11:417–487, 2011.
  33. Characterization of gromov-type geodesics. Differential Geometry and its Applications, 88:102006, 2023.
  34. Ippei Obayashi. Volume optimal cycle: Tightest representative cycle of a generator on persistent homology. SIAM J. Appl. Algebra Geom., 2:508–534, 2018.
  35. A roadmap for the computation of persistent homology. EPJ Data Science, 6:1–38, 2017.
  36. Computational optimal transport: With applications to data science. Foundations and Trends® in Machine Learning, 11(5-6):355–607, 2019.
  37. Gromov-wasserstein averaging of kernel and distance matrices. In International conference on machine learning, pages 2664–2672. PMLR, 2016.
  38. Cycle registration in persistent homology with applications in topological bootstrap. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(5):5579–5593, 2022.
  39. Co-optimal transport. arXiv preprint arXiv:2002.03731, 2020.
  40. Towards a new approach to reveal dynamical organization of the brain using topological data analysis. Nature communications, 9(1):1399, 2018.
  41. Interactive knot theory with knotplot. In Multimedia Tools for Communicating Mathematics, pages 277–290. Springer, 2002.
  42. Revealing hidden medium-range order in amorphous materials using topological data analysis. Science Advances, 6(37):eabc2320, 2020.
  43. Karl-Theodor Sturm. The Space of Spaces: Curvature Bounds and Gradient Flows on the Space of Metric Measure Spaces, volume 290. American Mathematical Society, 2023.
  44. Topological approximate bayesian computation for parameter inference of an angiogenesis model. Bioinformatics, 38(9):2529–2535, 2022.
  45. Optimal transport for structured data with application on graphs. In International Conference on Machine Learning, pages 6275–6284. PMLR, 2019.
  46. Co-optimal transport. Advances in neural information processing systems, 33:17559–17570, 2020.
  47. Fréchet means for distributions of persistence diagrams. Discrete & Computational Geometry, 52:44–70, 2014.
  48. Fused gromov-wasserstein distance for structured objects. Algorithms, 13(9):212, 2020.
  49. Fast computation of persistent homology representatives with involuted persistent homology, 2021.
  50. Cédric Villani et al. Optimal transport: old and new, volume 338. Springer, 2009.
  51. Multiparameter persistent homology landscapes identify immune cell spatial patterns in tumors. Proceedings of the National Academy of Sciences, 118(41):e2102166118, 2021.
  52. Larry Wasserman. Topological data analysis. Annual Review of Statistics and Its Application, 5:501–532, 2018.
  53. Scalable gromov-wasserstein learning for graph partitioning and matching. Advances in neural information processing systems, 32, 2019.
  54. Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning, pages 6932–6941. PMLR, 2019.
  55. Persistent extensions and analogous bars: data-induced relations between persistence barcodes. Journal of Applied and Computational Topology, pages 1–47, 2023.
  56. Afra Zomorodian. Topological data analysis. Advances in applied and computational topology, 70:1–39, 2012.
  57. Computing persistent homology. Discrete & Computational Geometry, 33(2):249–274, 2005.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Stephen Y Zhang (4 papers)
  2. Tom Needham (43 papers)
  3. Agnese Barbensi (13 papers)
  4. Michael P H Stumpf (5 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets