Related papers: Stability and Machine Learning Applications of Per…
Persistent homology computes the multiscale topology of a data set by using a sequence of discrete complexes. In this paper, we propose that persistent homology may be a useful tool for studying the structure of the landscape of string…
Persistent homology (PH) is a recently developed theory in the field of algebraic topology to study shapes of datasets. It is an effective data analysis tool that is robust to noise and has been widely applied. We demonstrate a general…
This paper proposes a stable volume and a stable volume variant, referred to as a stable sub-volume, for more reliable data analysis using persistent homology. In prior research, an optimal cycle and similar ideas have been proposed to…
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…
This article studies the robust version of persistent homology based on trimming methodology to capture the geometric feature through support of the data in presence of outliers. Precisely speaking, the proposed methodology works when the…
Observing critical phases in lattice models is challenging due to the need to analyze the finite time or size scaling of observables. We study how the computational topology technique of persistent homology can be used to characterize…
Let $X$ be a closed subspace of a metric space $M$. Under mild hypotheses, one can estimate the Betti numbers of $X$ from a finite set $P \subset M$ of points approximating $X$. In this paper, we show that one can also use $P$ to estimate…
Topological data analysis (TDA) delivers invaluable and complementary information on the intrinsic properties of data inaccessible to conventional methods. However, high computational costs remain the primary roadblock hindering the…
Hyperuniformity, the suppression of density fluctuations at large length scales, is observed across a wide variety of domains, from cosmology to condensed matter and biological systems. Although the standard definition of hyperuniformity…
The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…
Topological Data Analysis (TDA) studies the shape of data. A common topological descriptor is the persistence diagram, which encodes topological features in a topological space at different scales. Turner, Mukeherjee, and Boyer showed that…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
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…
Carlsson, Singh and Memoli's TDA mapper takes a point cloud dataset and outputs a graph that depends on several parameter choices. Dey, Memoli, and Wang developed Multiscale Mapper for abstract topological spaces so that parameter choices…
Persistent homology has been devised as a promising tool for the topological simplification of complex data. However, it is computationally intractable for large data sets. In this work, we introduce multiresolution persistent homology for…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as a computational step in neural networks or deep learning. In…
By their nature it is difficult to differentiate chaotic dynamical systems through measurement. In recent years, work has begun on using methods of Topological Data Analysis (TDA) to qualitatively type dynamical data by approximating the…
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…
Persistence diagrams offer a way to summarize topological and geometric properties latent in datasets. While several methods have been developed that utilize persistence diagrams in statistical inference, a full Bayesian treatment remains…