Related papers: Contractions in persistence and metric graphs

Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field.…

We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…

We consider immersions admitting uniform representations as an L-Lipschitz graph. In codimension 1, we show compactness for such immersions for arbitrary fixed finite L and uniformly bounded volume. The same result is shown in arbitrary…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

In this note we find $\lambda>1$ and give an explicit construction of a separable Banach space $X$ such that there is no $\lambda$-Lipschitz retraction from $X$ onto any compact convex subset of $X$ whose closed linear span is $X$. This is…

Let $G$ be a connected graph with $n$ vertices. The resistance distance $\Omega_{G}(i,j)$ between any two vertices $i$ and $j$ of $G$ is defined as the effective resistance between them in the electrical network constructed from $G$ by…

In this paper we prove a generalisation of Schlenk's theorem about the existence of contractible periodic Reeb orbits on stable, displaceable hypersurfaces in symplectically aspherical, geometrically bounded, symplectic manifolds, to a…

This paper discusses, certain algebraic, analytic, and topological results on partial iterated function systems($IFS_p$'s). Also, the article proves the Collage theorem for partial iterated function systems. Further, it provides a method to…

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…

In this paper, we study the differential inclusion associated to the minimal surface system for two-dimensional graphs in $\mathbb{R}^{2 + n}$. We prove regularity of $W^{1,2}$ solutions and a compactness result for approximate solutions of…

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…

This paper deals with retraction - intended as isomorphic embedding - in intersection types building left and right inverses as terms of a lambda calculus with a bottom constant. The main result is a necessary and sufficient condition two…

We prove that given an $n$-dimensional integral current space and a $1$-Lipschitz map, from this space onto the $n$-dimensional Euclidean ball, that preserves the mass of the current and is injective on the boundary, then the map has to be…

Let $X$ be a Banach space or more generally a complete metric space admitting a conical geodesic bicombing. We prove that every closed $L$-Lipschitz curve $\gamma:S^1\rightarrow X$ may be extended to an $L$-Lipschitz map defined on the…

We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in $O(1)$ time. Moreover, it can report…

In this paper, we study the existence of fixed points for mappings defined on complete, (sequentially compact) cone metric spaces, satisfying a general contractive inequality depending of two additional mappings.

We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…