Related papers: Ephemeral persistence features and the stability o…
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
We construct worst-case examples for the standard reduction algorithm for computing persistent homology. Our constructions are similar to the worst-case examples introduced by Morozov, but we replace the single-triangle arrangement with a…
In Topological Data Analysis, a common way of quantifying the shape of data is to use a persistence diagram (PD). PDs are multisets of points in $\mathbb{R}^2$ computed using tools of algebraic topology. However, this multi-set structure…
In this paper, we offer a new perspective on persistent homology by integrating key concepts from metric geometry. For a given compact subset $\mathcal{X}$ of a Banach space $\mathbf{Y}$, we analyze the topological features arising in the…
We prove an extension to the simplicial Nerve Lemma which establishes isomorphism of persistent homology groups, in the case where the covering spaces are filtered. While persistent homology is now widely used in topological data analysis,…
We establish long-time stability of multi-dimensional noncharacteristic boundary layers of a class of hyperbolic--parabolic systems including the compressible Navier--Stokes equations with inflow [outflow] boundary conditions, under the…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…
Coherent structures are solutions to reaction-diffusion systems that are time-periodic in an appropriate moving frame and spatially asymptotic at $x=\pm\infty$ to spatially periodic travelling waves. This paper is concerned with sources…
Persistent homology is a powerful tool for characterizing the topology of a data set at various geometric scales. When applied to the description of molecular structures, persistent homology can capture the multiscale geometric features and…
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…
Weighted digraphs are used to model a variety of natural systems and can exhibit interesting structure across a range of scales. In order to understand and compare these systems, we require stable, interpretable, multiscale descriptors. To…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
This article has two goals. First, we hope to give an accessible introduction to persistent equivariant cohomology. Given a topological group $G$ acting on a filtered space, persistent Borel equivariant cohomology measures not only the…
Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…
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…
Graph-structured data arise in a variety of real-world context ranging from sensor and transportation to biological and social networks. As a ubiquitous tool to process graph-structured data, spectral graph filters have been used to solve…
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 define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…
Robust visual place recognition (VPR) requires scene representations that are invariant to various environmental challenges such as seasonal changes and variations due to ambient lighting conditions during day and night. Moreover, a…
In this paper we introduce the persistent magnitude, a new numerical invariant of (sufficiently nice) graded persistence modules. It is a weighted and signed count of the bars of the persistence module, in which a bar of the form $[a,b)$ in…