Related papers: Contractions in persistence and metric graphs

A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…

We prove that each sub-Riemannian manifold can be embedded in some Euclidean space preserving the length of all the curves in the manifold. The result is an extension of Nash $C^1$ Embedding Theorem. For more general metric spaces the same…

In this paper we prove two theorems. The first one is a structure result that describes the extrinsic geometry of an embedded surface with constant mean curvature (possibly zero) in a homogeneously regular Riemannian three-manifold, in any…

We generalize a bi-Lipschitz extension result of David and Semmes from Euclidean spaces to complete metric measure spaces with controlled geometry (Ahlfors regularity and supporting a Poincar\'e inequality). In particular, we find sharp…

Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…

We study random walks on sub-Riemannian manifolds using the framework of retractions, i.e., approximations of normal geodesics. We show that such walks converge to the correct horizontal Brownian motion if normal geodesics are approximated…

We study the asymptotical behaviour of iterates of piecewise contractive maps of the interval. It is known that Poincar\'e first return maps induced by some Cherry flows on transverse intervals are, up to topological conjugacy, piecewise…

We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich,…

For a Banach space $B$ and for a class $\A$ of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements $A \in \A$ can be chosen to depend continuously on $A$, whenever nonconvexity of each $A…

For any metric space $X$, finite subset spaces of $X$ provide a sequence of isometric embeddings $X=X(1)\subset X(2)\subset\cdots$. The existence of Lipschitz retractions $r_n\colon X(n)\to X(n-1)$ depends on the geometry of $X$ in a subtle…

Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…

In this note, we show that the solution to the Dirichlet problem for the minimal surface system in any codimension is unique in the space of distance-decreasing maps. This follows as a corollary of the following stability theorem: if a…

Assume that $X$ is a Banach space of measurable functions for which Koml\'os' Theorem holds. We associate to any closed convex bounded subset $C$ of $X$ a coefficient $t(C)$ which attains its minimum value when $C$ is closed for the…

If $(X,d)$ is a metric space then the map $f\colon X\to X$ is defined to be a weak contraction if $d(f(x),f(y))<d(x,y)$ for all $x,y\in X$, $x\neq y$. We determine the simplest non-closed sets $X\subseteq \mathbb{R}^n$ in the sense of…

We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…

Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…

The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…

We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…