Related papers: Universal Distances for Extended Persistence
We introduce two new distances for zigzag persistence modules. The first uses Auslander-Reiten quiver theory, and the second is an extension of the classical interleaving distance. Both are defined over completely general orientations of…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
We revisit the classical Unit Distance Problem posed by Erd\H{o}s in 1946. While the upper bound of $O(n^{4/3})$ established by Spencer, Szemer'edi, and Trotter (1984) is tight for systems of pseudo-circles, it fails to account for the…
We prove a persistence result for noncompact normally hyperbolic invariant manifolds in the setting of Riemannian manifolds of bounded geometry. Bounded geometry of the ambient manifold is a crucial assumption required to control the…
A graph $G=(V,E)$ on $n$ vertices is said to be \emph{distance exceptional} if the equation $D\vec{x} = \vec{1}$ admits no solution $\vec{x}\in\mathbb{R}^{n}$, where $D\in\mathbb{R}^{n\times n}$ is the shortest path distance matrix of $G$.…
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…
Stability of persistence diagrams under slight perturbations is a key characteristic behind the validity and growing popularity of topological data analysis in exploring real-world data. Central to this stability is the use of Bottleneck…
We investigate the relevance of the conformal method by investigating stability issues for the Einstein-Lichnerowicz conformal constraint system in a nonlinear scalar-field setting. We prove the stability of the system with respect to…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…
In this paper, a new global exponential stability criterion is obtained for a general multidimensional delay difference equation using induction arguments. In the cases that the difference equation is periodic, we prove the existence of a…
This paper establishes limit theorems and quantitative statistical stability for a class of piecewise partially hyperbolic maps that are not necessarily continuous nor locally invertible. By employing a flexible functional-analytic…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
Persistence in spatially extended dynamical systems (like coarsening systems and other nonequilibrium systems) is reviewed. We discuss, in particular, the spatial correlations in the persistent regions and their evolution in time in these…
The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
Motivated both by theoretical and practical considerations in topological data analysis, we generalize the $p$-Wasserstein distance on barcodes to multiparameter persistence modules. For each $p\in [1,\infty]$, we in fact introduce two such…
Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of $k$ vertices is a natural generalization of the regular distance. We extend…
The persistence theory has been employed by several authors in order to study persistence properties of dynamical systems generated by ordinary differential equations or maps across diverse disciplines. In this note, the author discusses a…
We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model, in the supercritical regime. Under the assumption that the covariance between the…
We construct a non-local Benamou-Brenier-type transport distance on the space of stationary point processes and analyse the induced geometry. We show that our metric is a specific variant of the transport distance recently constructed in…