YoVDO

Barbara Giunti - Average Complexity of Barcode Computation for Vietoris-Rips Filtrations

Offered By: Applied Algebraic Topology Network via YouTube

Tags

Persistent Homology Courses Algorithmic Complexity Courses Computational Mathematics Courses Applied Algebraic Topology Courses

Course Description

Overview

Explore the algorithmic complexity of computing persistent homology for random Vietoris-Rips filtrations in this 52-minute conference talk by Barbara Giunti. Delve into the first theoretical study of its kind, examining upper bounds for the average fill-up of the boundary matrix after reduction. Discover how these bounds suggest a significantly sparser reduced matrix compared to general worst-case predictions. Learn about the connection between expected first Betti numbers of Vietoris-Rips complexes and boundary matrix fill-up. Understand the broader applicability of these results to clique filtrations that "become acyclic fast enough" and their potential expansion to other degrees and filtrations. Examine benchmarks demonstrating the asymptotic tightness of the bound for Vietoris-Rips complexes. If time allows, explore the construction of a clique filtration achieving worst-case fill-up and complexity.

Syllabus

Introduction
Characters
Bounding complexity
Fillup
Intuition
Key observation
Random model
lemma
Click filtration
Discussion


Taught by

Applied Algebraic Topology Network

Related Courses

مقدمة في علم الحاسوب والبرمجة
Massachusetts Institute of Technology via Edraak
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer
Computational Thinking using Python
Massachusetts Institute of Technology via edX
Java: Algorithms
Codecademy
Technical Interview Practice with Java
Codecademy