Related papers: Contractions in persistence and metric graphs
Graphs model real-world circumstances in many applications where they may constantly change to capture the dynamic behavior of the phenomena. Topological persistence which provides a set of birth and death pairs for the topological features…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We introduce "logically contractive mappings" nonexpansive self-maps that contract along a subsequence of iterates and prove a fixed-point theorem that extends Banach's principle. We obtain event-indexed convergence rates and, under bounded…
We prove the $1$-dimensional flat chain conjecture in any complete and quasiconvex metric space, namely that metric $1$-currents can be approximated in mass by normal $1$-currents. The proof relies on a new Banach space isomorphism theorem,…
In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. In the context of moving autonomous agent formations,…
The problems of continuation of a partially defined metric and a partially defined ultrametric were considered in (O. Dovgoshey, O. Martio and M. Vuorinen, Metrization of weighted graphs, Ann. Comb., 17:455--476, 2013) and (A. A. Dovgoshey…
We find conditions under which Almgren-Pitts min-max for the prescribed geodesic curvature functional in a closed oriented Riemannian surface produces a closed embedded curve of constant curvature. In particular, we find a closed embedded…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
Contraction analysis uses a local criterion to prove the long-term behaviour of a dynamical system. A contraction metric is a Riemannian metric with respect to which the distance between adjacent solutions contracts. If adjacent solutions…
Through the establishment of several extension theorems, we provide explicit expressions for all contractive projections and 1-complemented subspaces in the Hardy space $H^p(\mathbb{T})$ for $1\leq p<\infty$, $p\neq 2$. Our characterization…
The contribution of this work is twofold. The first part deals with a Hilbert-space version of McCann's celebrated result on the existence and uniqueness of monotone measure-preserving maps: given two probability measures $\rm P$ and $\rm…
Contraction rates of time-varying maps induced by dynamical systems illuminate a wide range of asymptotic properties with applications in stability analysis and control theory. In finite-dimensional smoothly varying inner-product spaces…
We consider a new type of mappings in metric spaces which can be characterized as mappings contracting perimeters of triangles. It is shown that such mappings are continuous. The fixed-point theorem for such mappings is proved and the…
Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…
Let $X(n),$ for $n\in\mathbb{N},$ be the set of all subsets of a metric space $(X,d)$ of cardinality at most $n.$ The set $X(n)$ equipped with the Hausdorff metric is called a finite subset space. In this paper we are concerned with the…
Persistent homology is a fundamental tool in Topological Data Analysis. The associated algebraic structure is the persistence module, a sequence of vector spaces connected by linear maps. Persistence modules admit a complete and…
Contraction theory for dynamical systems on Euclidean spaces is well-established. For contractive (resp. semi-contractive) systems, the distance (resp. semi-distance) between any two trajectories decreases exponentially fast. For partially…
Time-delay embedding is a fundamental technique in Topological Data Analysis (TDA) for reconstructing the phase space dynamics of time-series data. Persistent homology effectively identifies global topological features, such as loops…
We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…