相关论文: Persistent homology with non-contractible preimage…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
By general case we mean methods able to process simplicial sets and chain complexes not of finite type. A filtration of the object to be studied is the heart of both subjects persistent homology and spectral sequences. In this paper we…
We describe the relation of $r$-similarity and finite-order invariants on the homotopy set $[S^1,Y]=\pi_1(Y)$.
Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…
In our earlier papers we constructed examples of 2-dimensional nonaspherical simply-connected cell-like Peano continua, called {\sl Snake space}. In the sequel we introduced the functor $SC(-,-)$ defined on the category of all spaces with…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the…
We can view the Lipschitz constant as a height function on the space of maps between two manifolds and ask (as Gromov did nearly 30 years ago) what its ``Morse landscape'' looks like: are there high peaks, deep valleys and mountain passes?…
This paper is a survey of persistent homology, primarily as it is used in topological data analysis. It includes the theory of persistence modules, as well as stability theorems for persistence barcodes, generalized persistence,…
Persistence diagrams, which summarize the birth and death of homological features extracted from data, are employed as stable signatures for applications in image analysis and other areas. Besides simply considering the multiset of…
Persistent homology is a popular technique in topological data analysis that tracks the lifespans of homological features in a nested sequence of spaces. This data is typically presented in a multi-set called a persistence diagram or a…
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…
Let $f$ be a Morse function on a smooth compact manifold $M$ with boundary. The path component $\mathrm{PH}_f^{-1}(D)$ containing $f$ of the space of Morse functions giving rise to the same Persistent Homology $D=\mathrm{PH}(f))$ is shown…
We describe the behaviour of the homotopy similarity relations and finite-order invariants under the function $[X,Y]\to[X,Z]$ induced by a map $Y\to Z$ strongly $r$-similar to the constant map.
Persistence homology is a tool used to measure topological features that are present in data sets and functions. Persistence pairs births and deaths of these features as we iterate through the sublevel sets of the data or function of…
One of the primary areas of interest in applied algebraic topology is persistent homology, and, more specifically, the persistence diagram. Persistence diagrams have also become objects of interest in topological data analysis. However,…
Persistent homology provides a robust methodology to infer topological structures from point cloud data. Here we explore the persistent homology of point clouds embedded into a probabilistic setting, exploiting the theory of point…
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features (2000) as one varies a tuning parameter. Features with short…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
In this paper we study the homotopy type of $\Hom(C_m,C_n)$, where $C_k$ is the cyclic graph with $k$ vertices. We enumerate connected components of $\Hom(C_m,C_n)$ and show that each such component is either homeomorphic to a point or…