Counting Embedded Spheres with the Same Persistence
Offered By: Applied Algebraic Topology Network via YouTube
Course Description
Overview
Explore a 34-minute conference talk that delves into the extension of collaborative work on inverse problems in Topological Data Analysis. Learn about a closed-form formula for counting unbraided height equivalence classes of embedded two-spheres with a prescribed level-set barcode. Discover how this research, conducted by Justin Curry and PhD student Jordan DeSha, establishes a conjecture from earlier work. Gain insights into topics such as the Eldar rule, merge trees, and graph equivalence. Follow the presentation's structure, which includes an introduction, review of inverse problems, and a dedicated question session at the end.
Syllabus
Introduction
Inverse problems
Review
Eldar rule
Merge trees
Graph equivalence
Questions
Taught by
Applied Algebraic Topology Network
Related Courses
Topological Data Analysis - New Perspectives on Machine Learning - by Jesse JohnsonOpen Data Science via YouTube Analyzing Point Processes Using Topological Data Analysis
Applied Algebraic Topology Network via YouTube MD Simulations and Machine Learning to Quantify Interfacial Hydrophobicity
Applied Algebraic Topology Network via YouTube Topological Data Analysis of Plant-Pollinator Resource Complexes - Melinda Kleczynski
Applied Algebraic Topology Network via YouTube Hubert Wagner - Topological Data Analysis in Non-Euclidean Spaces
Applied Algebraic Topology Network via YouTube