Related papers: One-Dimensional Reduction of Multidimensional Pers…
This paper aims to discuss a method of quantifying the 'shape' of data, via a methodology called topological data analysis. The main tool within topological data analysis is persistent homology; this is a means of measuring the shape of…
We study random simplicial complexes in the multi-parameter upper model. In this model simplices of various dimensions are taken randomly and independently, and our random simplicial complex $Y$ is then taken to be the minimal simplicial…
A suitable feature representation that can both preserve the data intrinsic information and reduce data complexity and dimensionality is key to the performance of machine learning models. Deeply rooted in algebraic topology, persistent…
Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field.…
In Persistent Homology and Topology, filtrations are usually given by introducing an ordered collection of sets or a continuous function from a topological space to $\R^n$. A natural question arises, whether these approaches are equivalent…
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
Multifractals are inhomogeneous measures (or functions) which are typically described by a full spectrum of real dimensions, as opposed to a single real dimension. Results from the study of fractal strings in the analysis of their geometry,…
The symmetric simple exclusion process is one of the simplest out-of-equilibrium systems for which the steady state is known. Its large deviation functional of the density has been computed in the past both by microscopic and macroscopic…
The alpha complex efficiently computes persistent homology of a point cloud $X$ in Euclidean space when the dimension $d$ is low. Given a subset $A$ of $X$, relative persistent homology can be computed as the persistent homology of the…
In this paper, we extend bottleneck stability to the setting of one dimensional constructible persistences module valued in any small abelian category.
We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…
Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We overview the theory of classical MDS, along with its…
The persistent homology transform (PHT) of a subset $M \subset \mathbb{R}^d$ is a map $\text{PHT}(M):\mathbb{S}^{d-1} \to \mathbf{Dgm}$ from the unit sphere to the space of persistence diagrams. This map assigns to each direction $v\in…
In my masters thesis I prove a square root bound on the distance of homological codes that come from two dimensional surfaces, as a result of the systolic inequality. I also give a detailed version of M.H. Freedman's proof that due to…
We prove a homological stability theorem for moduli spaces of simply-connected manifolds of dimension $2n > 4$, with respect to forming connected sum with $S^n \times S^n$. This is analogous to Harer's stability theorem for the homology of…
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…
Persistent homology is a central methodology in topological data analysis that has been successfully implemented in many fields and is becoming increasingly popular and relevant. The output of persistent homology is a persistence diagram --…
The measurement of distance between two objects is generalized to the case where the objects are no longer points but are one-dimensional. Additional concepts such as non-extensibility, curvature constraints, and non-crossing become central…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…