Related papers: Multidimensional Persistence and Noise
Understanding the decision-making processes of large language models is critical given their widespread applications. To achieve this, we aim to connect a formal mathematical framework - zigzag persistence from topological data analysis -…
The persistence barcode is a well-established complete discrete invariant for finitely generated persistence modules [5] [1]. Its definition, however, does not extend to multi- dimensional persistence modules. In this paper, we introduce a…
One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…
Persistence has proved to be a valuable tool to analyze real world data robustly. Several approaches to persistence have been attempted over time, some topological in flavor, based on the vector space-valued homology functor, other…
Certain classes of multiparameter persistence modules may be encoded as signed barcodes, represented as points in a polyhedral subset of Euclidean space, we refer to as signed persistence diagrams. These signed persistence diagrams exist in…
The Harder-Narasimhan types are a family of discrete isomorphism invariants for representations of finite quivers. Previously (arXiv:2303.16075), we evaluated their discriminating power in the context of persistence modules over a finite…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
A recent result on size functions is extended to higher homology modules: the persistent homology based on a multidimensional measuring function is reduced to a 1-dimensional one. This leads to a stable distance for multidimensional…
Persistent homology is a popular computational tool for analyzing the topology of point clouds, such as the presence of loops or voids. However, many real-world datasets with low intrinsic dimensionality reside in an ambient space of much…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…
Characterizing the dynamics of time-evolving data within the framework of topological data analysis (TDA) has been attracting increasingly more attention. Popular instances of time-evolving data include flocking/swarming behaviors in…
It has been shown that $1$-parameter persistence modules have a very simple classification, namely there is a discrete invariant called a barcode that completely characterizes $1$-parameter persistence modules up to isomorphism. In…
We develop a new method to estimate the area, and more generally the intrinsic volumes, of a compact subset $X$ of $\mathbb{R}^d$ from a set $Y$ that is close in the Hausdorff distance. This estimator enjoys a linear rate of convergence as…
The persistence barcode is a topological descriptor of data that plays a fundamental role in topological data analysis. Given a filtration of data, the persistence barcode tracks the evolution of its homology groups. In this paper, we…
Topological data analysis (TDA) is a rapidly developing collection of methods for studying the shape of point cloud and other data types. One popular approach, designed to be robust to noise and outliers, is to first use a smoothing…
The ``Fundamental Theorem" given by Arnold in [2] asserts the persistence of full dimensional invariant tori for 2-scale Hamiltonian systems. However, persistence in multi-scale systems is much more complicated and difficult. In this paper,…
The use of persistent homology in applications is justified by the validity of certain stability results. At the core of such results is a notion of distance between the invariants that one associates with data sets. Here we introduce a…
We propose a flexible algorithm for feature detection and hypothesis testing in images with ultra low signal-to-noise ratio using cubical persistent homology. Our main application is in the identification of atomic columns and other…
We establish strong Feller property and irreducibility for the transition semigroup associated to a class of nonlinear stochastic partial differential equations with multiplicative degenerate noise. As a by-product, we prove uniqueness of…