Explore the computation of Gromov-Hausdorff distances between ultrametric spaces in this 28-minute lecture by Zhengchao Wan. Delve into the concept of ultrametric spaces, understand the Gromov-Hausdorff decision problem, and learn about the theorem that forms the basis for a recursive algorithm. Examine the complexity analysis of the algorithm and discover how dynamic programming can be applied to optimize the solution. Witness a practical demonstration and engage in a Q&A session to solidify your understanding of this advanced topic in applied algebraic topology.
Computing Gromov-Hausdorff Distances Between Ultrametric Spaces
Applied Algebraic Topology Network via YouTube
Overview
Syllabus
Introduction
What are ultrametric spaces
Computing GromovHausdorff distances
GromovHausdorff
Decision problem
Theorem
Recursive Algorithm
Complexity Analysis
Dynamic Programming
Demo
Summary
Questions
Taught by
Applied Algebraic Topology Network
