Related papers: Limit Theorems for Verbose Persistence Diagrams
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…
We address the problem of estimating multiple modes of a multivariate density using persistent homology, a central tool in Topological Data Analysis. We introduce a method based on the preliminary estimation of the $H_0$-persistence diagram…
Persistent homology is a technique recently developed in algebraic and computational topology well-suited to analysing structure in complex, high-dimensional data. In this paper, we exposit the theory of persistent homology from first…
Given a finite set in a metric space, the topological analysis generalizes hierarchical clustering using a 1-parameter family of homology groups to quantify connectivity in all dimensions. The connectivity is compactly described by the…
Biomolecular structure comparison not only reveals evolutionary relationships, but also sheds light on biological functional properties. However, traditional definitions of structure or sequence similarity always involve superposition or…
Multidimensional persistence modules do not admit a concise representation analogous to that provided by persistence diagrams for real-valued functions. However, there is no obstruction for multidimensional persistent Betti numbers to admit…
Given a persistence diagram with $n$ points, we give an algorithm that produces a sequence of $n$ persistence diagrams converging in bottleneck distance to the input diagram, the $i$th of which has $i$ distinct (weighted) points and is a…
Topologically ordered phases of matter display a number of unique characteristics, including ground states that can be interpreted as patterns of closed strings. In this paper, we consider the problem of detecting and distinguishing closed…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
We start with a simple introduction to topological data analysis where the most popular tool is called a persistent diagram. Briefly, a persistent diagram is a multiset of points in the plane describing the persistence of topological…
As the size of data increase, persistence diagrams often exhibit structured asymptotic behavior, converging weakly to a Radon measure. However, conventional vector summaries such as persistence landscapes are not well-behaved in this…
We consider the problem of generating hypothesis from data based on ideas from logic. We introduce a notion of barcodes, which we call sequent barcodes, that mirrors the barcodes in persistent homology theory in topological data analysis.…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…
One-dimensional persistent homology is arguably the most important and heavily used computational tool in topological data analysis. Additional information can be extracted from datasets by studying multi-dimensional persistence modules and…
The persistence barcode is a topological descriptor of data that plays a fundamental role in topological data analysis. Given a filtration of the space of data, a persistence barcode tracks the evolution of its homological features. In this…
In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals…
Topological data analysis involves the statistical characterization of the shape of data. Persistent homology is a primary tool of topological data analysis, which can be used to analyze topological features and perform statistical…
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…
Persistence diagrams are one of the main tools in the field of Topological Data Analysis (TDA). They contain fruitful information about the shape of data. The use of machine learning algorithms on the space of persistence diagrams proves to…