Related papers: On persistent homology of random \v{C}ech complexe…
The objective of this paper is to examine the asymptotic behavior of persistence diagrams associated with \v{C}ech filtration. A persistence diagram is a graphical descriptor of a topological and algebraic structure of geometric objects. We…
We consider random filtered complexes built over marked point processes on Euclidean spaces. Examples of our filtered complexes include a filtration of $\check{\textrm{C}}$ech complexes of a family of sets with various sizes, growths, and…
Persistent homology is a popular data analysis technique that is used to capture the changing topology of a filtration associated with some simplicial complex $K$. These topological changes are summarized in persistence diagrams. We propose…
The \v{C}ech complex is one of the most widely used tools in applied algebraic topology. Unfortunately, due to the inclusive nature of the \v{C}ech filtration, the number of simplices grows exponentially in the number of input points. A…
In this paper, we prove a universality result for the limiting distribution of persistence diagrams arising from geometric filtrations over random point processes. Specifically, we consider the distribution of the ratio of persistence…
We study the persistent homology of random \v{C}ech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main…
A filtration over a simplicial complex $K$ is an ordering of the simplices of $K$ such that all prefixes in the ordering are subcomplexes of $K$. Filtrations are at the core of Persistent Homology, a major tool in Topological Data Analysis.…
Computation of the simplicial complexes of a large point cloud often relies on extracting a sample, to reduce the associated computational burden. The study considers sampling critical points of a Morse function associated to a point cloud,…
We study the homology of random \v{C}ech complexes generated by a homogeneous Poisson process. We focus on 'homological connectivity' - the stage where the random complex is dense enough, so that its homology "stabilizes" and becomes…
We give an $O(n^2(k+\log n))$ algorithm for computing the $k$-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on $n$ vertices. This is nearly quadratic in the number of vertices $n$, and therefore a…
Given a compact geodesic space $X$ we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or \v{C}ech filtration of $X$ to obtain what we call a persistence. This paper contains the…
Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane $\mathbb{R}^2$ that can…
In this paper, we consider topological featurizations of data defined over simplicial complexes, like images and labeled graphs, obtained by convolving this data with various filters before computing persistence. Viewing a convolution…
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…
We initiate the study of persistent homology of random geometric simplicial complexes. Our main interest is in maximally persistent cycles of degree-$k$ in persistent homology, for a either the \cech or the Vietoris--Rips filtration built…
Persistence diagrams are useful displays that give a summary information regarding the topological features of some phenomenon. Usually, only one persistence diagram is available, and replicated persistence diagrams are needed for…
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…
In persistent homology analysis, interval modules play a central role in describing the birth and death of topological features across a filtration. In this work, we extend this setting, and propose the use of bipath persistent homology,…
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…
The aim of this paper is to present a method for computation of persistent homology that performs well at large filtration values. To this end we introduce the concept of filtered covers. We show that the persistent homology of a bounded…