Related papers: Monoidal Rips: Stable Multiparameter Filtrations o…
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…
The Rips filtration over a finite metric space and its corresponding persistent homology are prominent methods in TDA to summarise the shape of data. Crucial to their use is the bottleneck stability result. A generalisation of the Rips…
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…
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…
The so called \v{C}ech and Vietoris-Rips simplicial filtrations are designed to capture information about the topological structure of metric datasets. These filtrations are two of the workhorses in the field of topological data analysis.…
Persistent homology of the Rips filtration allows to track topological features of a point cloud over scales, and is a foundational tool of topological data analysis. Unfortunately, the Rips-filtration is exponentially sized, when…
The \v{C}ech and Rips constructions of persistent homology are stable with respect to perturbations of the input data. However, neither is robust to outliers, and both can be insensitive to topological structure of high-density regions of…
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 consider the degree-Rips construction from topological data analysis, which provides a density-sensitive, multiparameter hierarchical clustering algorithm. We analyze its stability to perturbations of the input data using the…
Two important tasks in the field of Topological Data Analysis are building practical multifiltrations on objects and using TDA to detect the geometry. Motivated by the tasks, we build multiparameter filtrations by operators on images named…
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…
Directed graphs arise in many applications where computing persistent homology helps to encode the shape and structure of the input information. However, there are only a few ways to turn the directed graph information into an undirected…
In this paper we define, implement, and investigate a simplicial complex construction for computing persistent homology of Euclidean point cloud data, which we call the Delaunay-Rips complex (DR). Assigning the Vietoris-Rips weights to…
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…
Distributed data collection is a fundamental task in open systems. In such networks, data is aggregated across a network to produce a single aggregated result at a source device. Though self-stabilizing, algorithms performing data…
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…
Multi-parameter persistent homology naturally arises in applications of persistent topology to data that come with extra information depending on additional parameters, like for example time series data. We introduce the concept of a…
We introduce persistence matching diagrams induced by set mappings of metric spaces, based on 0-persistent homology of Vietoris-Rips filtrations. Also, we present a geometric definition of the persistence matching diagram that is more…
The Vietoris-Rips filtration for an $n$-point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space. The persistent homology is a key tool in topological data analysis…
The Delaunay-Rips filtration is a lighter and faster alternative to the well-known Rips filtration for low-dimensional Euclidean point clouds. Despite these advantages, it has seldom been studied. In this paper, we aim to bridge this gap by…