Related papers: Vietoris-Rips Complexes of Regular Polygons
Fix a finite set of points in Euclidean $n$-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an…
For $X$ a metric space and $r\ge 0$, the anti-Vietoris-Rips metric thickening $\mathrm{AVR^m}(X;r)$ is the space of all finitely supported probability measures on $X$ whose support has spread at least $r$, equipped with an optimal transport…
The long computational time and large memory requirements for computing Vietoris Rips persistent homology from point clouds remains a significant deterrent to its application to big data. This paper aims to reduce the memory footprint of…
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…
The computation of Vietoris-Rips persistence barcodes is both execution-intensive and memory-intensive. In this paper, we study its computational structure and identify several unique mathematical properties and algorithmic opportunities…
We study combinatorial connectivity for two models of random geometric complexes. These two models - \v{C}ech and Vietoris-Rips complexes - are built on a homogeneous Poisson point process of intensity $n$ on a $d$-dimensional torus using…
We give bounds for dimension 0 persistent homology and codimension 1 homology of Vietoris--Rips, alpha, and cubical complex filtrations from finite sets related by enrichment (adding new elements), sparsification (removing elements), and…
We construct a compact subset K of the four dimensional Euclidean space with the following property: For all values of the parameter in an interval, the Vietoris-Rips complex of K has uncountably generated first homology. This answers a…
Persistent homology studies the evolution of k-dimensional holes along a nested sequence of simplicial complexes (called a filtration). The set of bars (i.e. intervals) representing birth and death times of k-dimensional holes along such…
Many simplicial complexes arising in practice have an associated metric space structure on the vertex set but not on the complex, e.g. the Vietoris-Rips complex in applied topology. We formalize a remedy by introducing a category of…
Persistent homology is one of the most popular methods in topological data analysis. An initial step in its use involves constructing a nested sequence of simplicial complexes. There is an abundance of different complexes to choose from,…
In this paper we study how randomly generated knots occupy a volume of space using topological methods. To this end, we consider the evolution of the first homology of an immersed metric neighbourhood of a knot's embedding for growing…
Topological data analysis, as a tool for extracting topological features and characterizing geometric shapes, has experienced significant development across diverse fields. Its key mathematical techniques include persistent homology and the…
We present a unified pipeline for univariate time series classification via complex networks and persistent homology. A time series is mapped to a graph through one of five constructions across three families (visibility (natural and…
Given a closed $n$-manifold, we consider the set of simple homotopy types of $n$-manifolds within its homotopy type, called its simple homotopy manifold set. We characterise it in terms of algebraic K-theory, the surgery obstruction map,…
For $n\geq 2$ we consider $(n-1)$-connected closed manifolds of dimension at most $(3n-2)$. We prove that away from a finite set of primes, the $p$-local homotopy groups of $M$ are determined by the dimension of the space of indecomposable…
Motivated by computational aspects of persistent homology for Vietoris-Rips filtrations, we generalize a result of Eliyahu Rips on the contractibility of Vietoris-Rips complexes of geodesic spaces for a suitable parameter depending on the…
We construct worst-case examples for the standard reduction algorithm for computing persistent homology. Our constructions are similar to the worst-case examples introduced by Morozov, but we replace the single-triangle arrangement with a…
Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips…
We present an algorithm for computing the barcode of the image of a morphisms in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. These algorithms make use of the clearing optimization and can be…