Related papers: Persistent Magnitude
We characterize the class of persistence modules indexed over $\mathbb{R}^2$ that are decomposable into summands whose support have the shape of a {\em block}---i.e. a horizontal band, a vertical band, an upper-right quadrant, or a…
Persistent homology is a fundamental tool in Topological Data Analysis. The associated algebraic structure is the persistence module, a sequence of vector spaces connected by linear maps. Persistence modules admit a complete and…
The persistence diagram is a central object in the study of persistent homology and has also been investigated in the context of random topology. The more recent notion of the verbose diagram (a.k.a. verbose barcode) is a refinement of the…
We study the geometric significance of Leinster's notion of magnitude for a smooth manifold with boundary of arbitrary dimension, motivated by open questions for the unit disk in $\mathbb{R}^2$. For a large class of distance functions,…
Persistent homology is a topological data analysis tool that has been widely generalized, extending its scope beyond the field of topology. Among its extensions, steady and ranging persistence were developed to study a wide variety of graph…
In persistent topology, q-tame modules appear as a natural and large class of persistence modules indexed over the real line for which a persistence diagram is definable. However, unlike persistence modules indexed over a totally ordered…
Magnitude is a canonical invariant of finite metric spaces which has its origins in category theory; it is analogous to cardinality of finite sets. Here, by approximating certain compact subsets of Euclidean space with finite subsets, the…
We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of…
As the size of data increase, persistence diagrams often exhibit structured asymptotic behavior, converging weakly to a Radon measure. However, conventional vector summaries such as persistence landscapes are not well-behaved in this…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
Long lived topological features are distinguished from short lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and…
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 modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jablonski,…
In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart…
A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…
We exhibit a change of variables that maintains the Mahler measure of a given polynomial. This method leads to the construction of highly non-trivial polynomials with given Mahler measure and settles some conjectural numerical formulas due…
We can approximate a continuous self-map $f$ of a compact metric space by discretizing the space into a grid. Through either the map itself or a time series, $f$ induces a multivalued grid map $\mathcal F$. The dynamical properties of…
We compute the magnitude (an isometric invariant of metric spaces) of compact $\mathbb{R}$-trees and show that it equals $1 + L/2$, where $L \in [0, \infty]$ denotes the total length. Although length is the only geometric invariant captured…