Related papers: Quantitative Simplification of Filtered Simplicial…
We introduce a fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the input sequence by using strong collapses, as introduced by…
Persistent homology is a popular method for computing topological features of (metric) data. Standard approaches based on the \v{C}ech or Rips filtration are stable under small perturbations of the data, but highly sensitive to outliers.…
In this paper we establish a natural definition of Lusternik-Schnirelmann category for simplicial complexes via the well known notion of contiguity. This category has the property of being homotopy invariant under strong equivalences, and…
We introduce harmonic persistent homology spaces for filtrations of finite simplicial complexes. As a result we can associate concrete subspaces of cycles to each bar of the barcode of the filtration. We prove stability of the harmonic…
The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We study curve-restricted min-\# simplification of polygonal curves, in which the…
The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…
Selective Rips complexes corresponding to a sequence of parameters are a generalization of Vietoris-Rips complexes utilizing the idea of thin simplices. We prove that if a metric space $Y$ is close (in Gromov-Hausdorff distance) to a closed…
Given a metric space $(X,d)$, the Vietoris-Rips complex of $X$ at a scale of $r >0$ is a simplicial complex whose simplices are all those finite subsets of $X$ with diameter less than $r$. In this paper, we classify, up to simplicial…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\mathrm{PH}$ takes a filter $f:K \rightarrow \mathbb{R}$ as input and returns the barcodes $\mathrm{PH}(f)$ of the associated sublevel set persistent…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
Given a sample $Y$ from an unknown manifold $X$ embedded in Euclidean space, it is possible to recover the homology groups of $X$ by building a Vietoris--Rips or \v{C}ech simplicial complex on top of the vertex set $Y$. However, these…
In this paper, we extract natural invariants of a singularity by using the Deligne weight filtration on the cohomology of an exceptional fibre of a resolution, and also on the intersection cohomology of the link. Our primary goal is to…
Dimensionality reduction techniques are powerful tools for data preprocessing and visualization which typically come with few guarantees concerning the topological correctness of an embedding. The interleaving distance between the…
In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…
Algorithms for persistent homology and zigzag persistent homology are well-studied for persistence modules where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under…
We introduce a distance function between simplicial complexes and study several of its properties.
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
Persistent homology is a natural tool for probing the topological characteristics of weighted graphs, essentially focusing on their $0$-dimensional homology. While this area has been substantially studied, we present a new approach to…
One of the attractions of homological mirror symmetry is that it not only implies the previous predictions of mirror symmetry (e.g., curve counts on the quintic), but it should in some sense be `less of a coincidence' than they are and…