Related papers: Universal Distances for Extended Persistence

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…

Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…

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…

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…

Reeb graphs are a fundamental structure for analyzing the topological and geometric properties of scalar fields. Comparing Reeb graphs is crucial for advancing research in this domain, yet existing metrics are often computationally…

Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…

Reeb graphs are widely used in a range of fields for the purposes of analyzing and comparing complex spaces via a simpler combinatorial object. Further, they are closely related to extended persistence diagrams, which largely but not…

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…

Starting from Sinclair's 1976 work {\it Automatic Continuity of Linear Operators}, Cambridge University Press, (1976), on automatic continuity of linear operators on Banach spaces, we prove that sequences of intertwining continuous linear…

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

We study the projective geometry of algebraic neural layers, namely families of maps induced by a polynomial activation function, with particular emphasis on the generic Euclidean Distance degree ($\mathrm{gED}$). This invariant is…

The main aim of this paper is to explore the ideas of persistent homology and extended persistent homology, and their stability theorems, using ideas from [Bubenik and Scott, 2014; Cohen-Steiner, Edelsbrunner, and Harer, 2007; and…

We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…

We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…

We introduce the convex matching distance, a novel metric for comparing functions with values in the real plane. This metric measures the maximal bottleneck distance between the persistence diagrams associated with the convex combinations…

In quantum physics, measurement error and disturbance were first naively thought to be simply constrained by the Heisenberg uncertainty relation. Later, more rigorous analysis showed that the error and disturbance satisfy more subtle…

Persistent homology has been recently studied with the tools of sheaf theory in the derived setting by Kashiwara and Schapira, after J. Curry has made the first link between persistent homology and sheaves. We prove the isometry theorem in…

In this paper, we give lower bounds for the homology of the fibers of a map to a manifold. Using new sheaf theoretic methods, we show that these lower bounds persist over whole open sets of the manifold, and that they are stable under…

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…

The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…