Related papers: The Theory of the Interleaving Distance on Multidi…
Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other…
First, we prove that a random metric space can be isometrically embedded into a complete random normed module, as an application of which, it is easy to see that the notion of $d$-$\sigma$-stability introduced for a nonempty subset of a…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
By invoking the reflection functors introduced by Bernstein, Gelfand, and Ponomarev in 1973, in this paper we define a metric on the space of all zigzag modules of a given length, which we call the reflection distance. We show that the…
Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…
Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…
In multi-parameter persistence, the matching distance is defined as the supremum of weighted bottleneck distances on the barcodes given by the restriction of persistence modules to lines with a positive slope. In the case of finitely…
The exact computation of the matching distance for multi-parameter persistence modules is an active area of research in computational topology. Achieving an easily obtainable exact computation of this distance would permit multi-parameter…
In this paper we provide an explicit connection between level-sets persistence and derived sheaf theory over the real line. In particular we construct a functor from 2-parameter persistence modules to sheaves over $\mathbb{R}$, as well as a…
Persistence modules stratify their underlying parameter space, a quality that make persistence modules amenable to study via invariants of stratified spaces. In this article, we extend a result previously known only for one-parameter…
Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an $\ell^p$-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it…
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…
Multidimensional persistence modules do not admit a concise representation analogous to that provided by persistence diagrams for real-valued functions. However, there is no obstruction for multidimensional persistent Betti numbers to admit…
We explore the space of scalar line, surface and interface defect field theories in $d=4-\varepsilon$ by examining their stability properties under generic deformations. Examples are known of multiple stable line defect Conformal Field…
In this article, we consider extended tame persistence commutative differential graded algebras (CDGAs) associated with relative Sullivan algebras. In particular, if the relative Sullivan algebra is a model for a map between spaces, then…
The Reeb graph is a construction that studies a topological space through the lens of a real valued function. It has widely been used in applications, however its use on real data means that it is desirable and increasingly necessary to…
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
The pruning distance recently introduced by Bjerkevik compares persistence modules using approximate decompositions called prunings. Bjerkevik conjectures that this distance is Lipschitz equivalent to the classical interleaving distance on…
The bedrock of persistence theory over a single parameter is decomposition of persistence modules into intervals. In [HLM24], the authors leveraged interval decomposition to produce a cell decomposition of the minimal model of a simply…
Magnitude homology is an emerging framework that captures the intrinsic topological and geometric features of metric spaces, demonstrating significant potential for topoplogical data analysis and geometric data analysis. This work…