The continued and dramatic rise in the size of data sets has meant that new methods are required to model and analyze them. This timely account introduces topological data …
Persistence theory emerged in the early 2000s as a new theory in the area of applied and computational topology. This book provides a broad and modern view of the subject …
Our intention, at the beginning, was to write a short paper resolving some technical issues in the theory of topological persistence. Specifically, we wished to present a clean easy-to-use …
The Handbook of Linear Algebra provides comprehensive coverage of linear algebra concepts, applications, and computational software packages in an easy-to-use handbook …
C Maria, JD Boissonnat, M Glisse, M Yvinec - … Software–ICMS 2014: 4th …, 2014 - Springer
We present the main algorithmic and design choices that have been made to represent complexes and compute persistent homology in the Gudhi library. The Gudhi library …
In this paper we discuss the adaptation of the methods of homology from algebraic topology to the problem of pattern recognition in point cloud data sets. The method is referred to as …
G Carlsson, V De Silva - Foundations of computational mathematics, 2010 - Springer
We describe a new methodology for studying persistence of topological features across a family of spaces or point-cloud data sets, called zigzag persistence. Building on classical …
M Lesnick - Foundations of Computational Mathematics, 2015 - Springer
In 2009, Chazal et al. introduced ϵ ϵ-interleavings of persistence modules. ϵ ϵ- interleavings induce a pseudometric d_ I d I on (isomorphism classes of) persistence …