Visualizing Sparse Filtrations

Over the last few years, there have been several approaches to building sparser complexes that still give good approximations to the persistent homology. In this video, we have illustrated a geometric perspective on sparse filtrations that leads to simpler proofs, more general theorems, and a more visual explanation. We hope that as these techniques become easier to understand, they will also become easier to use.

[1]  Tamal K. Dey,et al.  Computing Topological Persistence for Simplicial Maps , 2012, SoCG.

[2]  Magnus Bakke Botnan,et al.  Approximating persistent homology in Euclidean space through collapses , 2014, Applicable Algebra in Engineering, Communication and Computing.

[3]  Steve Oudot,et al.  Efficient and robust persistent homology for measures , 2016, Comput. Geom..

[4]  Michael Kerber,et al.  Approximate Čech Complex in Low and High Dimensions , 2013, ISAAC.

[5]  Don Sheehy,et al.  Linear-Size Approximations to the Vietoris–Rips Filtration , 2012, Discrete & Computational Geometry.