Related papers: Geodesics in persistence diagram space
The paper studies a general scheme for constructing metrics on a product of metric spaces by means of a family of continuous convex functions. This construction includes the conventional $p$-metrics and generates metrics that are…
We show that if $(X,d)$ is a metric space which admits a consistent convex geodesic bicombing, then we can construct a conical bicombing on $CB(X)$, the hyperspace of nonempty, closed, bounded, and convex subsets of $X$ (with the Hausdorff…
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection…
We propose the concepts of vicinal mappings and firmly vicinal mappings in metric spaces. We obtain fixed point and convergence theorems for these mappings in complete geodesic spaces with curvature bounded above by one and apply our…
We develop a new method for visualizing and refining the invariances of learned representations. Specifically, we test for a general form of invariance, linearization, in which the action of a transformation is confined to a low-dimensional…
The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…
By "geodesic" we mean any sequence of vertices $(v_1,v_2,...,v_k)$ of a graph $G$ that constitute a shortest path from $v_1$ to $v_k$. We propose a novel, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica)…
We construct convex bodies that can be "captured by nets." More precisely, for each dimension $n \geq 2$, we construct a family of Riemannian $n$-spheres, each with a stable geodesic net, which is a stable 1-dimensional integral varifold.…
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they…
We prove that the space of persistence diagrams on $n$ points (with the bottleneck or a Wasserstein distance) coarsely embeds into Hilbert space by showing it is of asymptotic dimension $2n$. Such an embedding enables utilisation of Hilbert…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
Metric graph properties lie in the heart of the analysis of complex networks, while in this paper we study their convexity through mathematical definition of a convex subgraph. A subgraph is convex if every geodesic path between the nodes…
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric…
In this paper, we study bijections on strictly convex sets of $\mathbf R \mathbf P^n$ for $n \geq 2$ and closed convex projective surfaces equipped with the Hilbert metric that map complete geodesics to complete geodesics as sets.…
The determination of the stability of the long-lived consensus problem is a fundamental open problem in distributed systems. We concentrate on the memoryless binary case with geodesic paths. We offer a conjecture on the stability in this…
We study geodesics in the Brownian map $(\mathcal{S},d,\nu)$, the random metric measure space which arises as the Gromov-Hausdorff scaling limit of uniformly random planar maps. Our results apply to all geodesics including those between…
We completely classify the bijections of the Thurston geometries that preserve geodesics as sets. For Riemannian manifolds that satisfy a certain technical condition, we prove that a totally geodesic subset is a submanifold. We also…
This short note establishes explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance between two zigzag persistence modules…