Related papers: Persistence for Circle Valued Maps
Persistence diagrams, the most common descriptors of Topological Data Analysis, encode topological properties of data and have already proved pivotal in many different applications of data science. However, since the (metric) space of…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
We study the multi-dimensional persistence of Carlsson and Zomorodian and obtain a finer classification based upon the higher tor-modules of a persistence module. We propose a variety structure on the set of isomorphism classes of these…
We investigate how invariant subspaces corresponding to a single eigenvalue will change when a matrix is perturbed. We focus on the invariant subspaces corresponding to an eigenvalue associated with the Jordan blocks that have the same…
We develop a Melnikov method for volume-preserving maps with codimension one invariant manifolds. The Melnikov function is shown to be related to the flux of the perturbation through the unperturbed invariant surface. As an example, we…
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…
Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\mathrm{PH}$ takes a filter $f:K \rightarrow \mathbb{R}$ as input and returns the barcodes $\mathrm{PH}(f)$ of the associated sublevel set persistent…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
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…
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric…
An ideal invariant for multiparameter persistence would be discriminative, computable and stable. In this work we analyse the discriminative power of a stable, computable invariant of multiparameter persistence modules: the fibered bar…
Most algorithms for computing persistent homology do so by tracking cycles that represent homology classes. There are many choices of such cycles, and specific choices have found different uses in applications. Although it is known that…
The topology of periodic spaces has attracted a lot of interest in recent years in order to study and classify crystalline structures and other large homogeneous data sets, such as the distribution of galaxies in cosmology. In practice,…
The theory of persistence modules is an emerging field of algebraic topology which originated in topological data analysis. In these notes we provide a concise introduction into this field and give an account on some of its interactions…
In this note one shows that the four persistence diagrams and measures defined in [5] are particular cases of the maps and the measures discussed in [2] and [1]
The aim of applied topology is to use and develop topological methods for applied mathematics, science and engineering. One of the main tools is persistent homology, an adaptation of classical homology, which assigns a barcode, i.e. a…
In this paper we study functions on the interval that have the same persistent homology. By introducing an equivalence relation modeled after topological conjugacy, which we call graph-equivalence, a precise enumeration of functions with…
Let $M_n$ be the algebra of $n \times n$ complex matrices. We consider arbitrary subalgebras $\mathcal{A}$ of $M_n$ which contain the algebra of all upper-triangular matrices (i.e.\ block upper-triangular subalgebras), and their Jordan…
Recently, multi-scale notions of local homology (a variant of persistent homology) have been used to study the local structure of spaces around a given point from a point cloud sample. Current reconstruction guarantees rely on constructing…