Related papers: The Persistent Homotopy Type Distance
The Persistent Homology Transform (PHT) summarizes a shape in $\mathbb{R}^m$ by collecting persistence diagrams obtained from linear height filtrations in all directions on $\mathbb{S}^{m-1}$. It enjoys strong theoretical guarantees,…
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a…
Interleaving distances provide a fundamental tool for comparing persistence modules and have been widely used in topological data analysis. Their definitions are typically based on translation structures (shift operations) on the indexing…
As a step towards establishing homotopy-theoretic foundations for topological data analysis (TDA), we introduce and study homotopy interleavings between filtered topological spaces. These are homotopy-invariant analogues of interleavings,…
In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is…
In this paper, we investigate a discrete version of the homotopic distance between two $s$-Lipschitz maps for $s \geq 0$. This distance is defined by specifying a step length $r$ to which some homotopy relation corresponds. In spaces with a…
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…
Nearness theory comes into play in homotopy theory because the notion of closeness between points is essential in determining whether two spaces are homotopy equivalent. While nearness theory and homotopy theory have different focuses and…
This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…
The Extended Persistent Homology Transform (XPHT) is a topological transform which takes as input a shape embedded in Euclidean space, and to each unit vector assigns the extended persistence module of the height function over that shape…
The use of persistent homology in applications is justified by the validity of certain stability results. At the core of such results is a notion of distance between the invariants that one associates with data sets. Here we introduce a…
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
The natural occurrence of singular spaces in applications has led to recent investigations on performing topological data analysis (TDA) in a stratified framework. In many applications, there is no a priori information on what points should…
The homotopy interleaving distance, a distance between persistent spaces, was introduced by Blumberg and Lesnick and shown to be universal, in the sense that it is the largest homotopy-invariant distance for which sublevel-set filtrations…
We introduce a persistence-like pseudo-distance on Tamarkin's category and prove that the distance between an object and its Hamiltonian deformation is at most the Hofer norm of the Hamiltonian function. Using the distance, we show a…
Vietoris-Rips and degree Rips complexes are represented as homotopy types by their underlying posets of simplices, and basic homotopy stability theorems are recast in these terms. These homotopy types are viewed as systems (or functors),…
Comparison between multidimensional persistent Betti numbers is often based on the multidimensional matching distance. While this metric is rather simple to define and compute by considering a suitable family of filtering functions…