Related papers: New families of simplicial filtration functors
The Vietoris-Rips filtration is a versatile tool in topological data analysis. It is a sequence of simplicial complexes built on a metric space to add topological structure to an otherwise disconnected set of points. It is widely used…
In this paper we study the properties of the homology of different geometric filtered complexes (such as Vietoris-Rips, Cech and witness complexes) built on top of precompact spaces. Using recent developments in the theory of topological…
We introduce a new invariant defined on the vertices of a given filtered simplicial complex, called codensity, which controls the impact of removing vertices on persistent homology. We achieve this control through the use of an interleaving…
The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth…
We study a family of invariants of compact metric spaces that combines the Curvature Sets defined by Gromov in the 1980s with Vietoris-Rips Persistent Homology. For given integers $k\geq 0$ and $n\geq 1$ we consider the dimension $k$…
We develop novel methods for using persistent homology to infer the homology of an unknown Riemannian manifold $(M, g)$ from a point cloud sampled from an arbitrary smooth probability density function. Standard distance-based filtered…
We introduce a new flavor of functor cocalculus, called \emph{poset cocalculus}, as a tool for studying approximations in topological data analysis. Given a functor from a distributive lattice to a model category, poset cocalculus produces…
\v{C}ech complexes reveal valuable topological information about point sets at a certain scale in arbitrary dimensions, but the sheer size of these complexes limits their practical impact. While recent work introduced approximation…
In this paper, we study the stability of commonly used filtration functions in topological data analysis under small perturbations of the underlying nonrandom point cloud. Relying on these stability results, we then develop a test procedure…
We introduce the monoidal Rips filtration, a filtered simplicial set for weighted directed graphs and other lattice-valued networks. Our construction generalizes the Vietoris-Rips filtration for metric spaces by replacing the maximum…
We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…
We extend classical tools from rational homotopy theory to topological data analysis by introducing persistent Sullivan minimal models of persistent topological spaces. Our main result establishes that the interleaving distance between such…
We explore emerging relationships between the Gromov--Hausdorff distance, Borsuk--Ulam theorems, and Vietoris--Rips simplicial complexes. The Gromov--Hausdorff distance between two metric spaces $X$ and~$Y$ can be lower bounded by the…
Proximity complexes and filtrations are central constructions in topological data analysis. Built using distance functions, or more generally metrics, they are often used to infer connectivity information from point clouds. Here we…
Discrete Forman-Ricci curvature (FRC) is an efficient tool that characterizes essential geometrical features and associated transitions of real-world networks, extending seamlessly to higher-dimensional computations in simplicial complexes.…
Latschev's theorem provides sufficient conditions on a metric space $M$ and $\delta > 0$ for the homotopy type of $M$ to agree with that of the Vietoris-Rips complex $\mathcal{R}^{\delta}(N)$ of any nearby space $N$ in the Gromov-Hausdorff…
This paper employs techniques from metric geometry and optimal transport theory to address questions related to the analysis of functional data on metric or metric-measure spaces, which we refer to as fields. Formally, fields are viewed as…
We introduce the concept of weighted persistence diagrams and develop a functorial pipeline for constructing them from finite metric measure spaces. This builds upon an existing functorial framework for generating classical persistence…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
A challenge in computational topology is to deal with large filtered geometric complexes built from point cloud data such as Vietoris-Rips filtrations. This has led to the development of schemes for parallel computation and compression…