Related papers: Geodesics in persistence diagram space
We introduce the convex matching distance, a novel metric for comparing functions with values in the real plane. This metric measures the maximal bottleneck distance between the persistence diagrams associated with the convex combinations…
We introduce persistence matching diagrams induced by set mappings of metric spaces, based on 0-persistent homology of Vietoris-Rips filtrations. Also, we present a geometric definition of the persistence matching diagram that is more…
We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…
In this paper we study geometric coincidence problems in the spirit of the following problems by B. Gr\"unbaum: How many affine diameters of a convex body in $\mathbb R^n$ must have a common point? How many centers (in some sense) of…
One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
The work consists of solutions of metric problems for convex and finite subsets of geodesic spaces.
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…
In this paper we compare the different phenomena that occur when intersecting geometric objects with random geodesics on the unit sphere and inside convex bodies. On the high dimensional sphere we see that with probability bounded away from…
This paper provides rates of convergence for empirical (generalised) barycenters on compact geodesic metric spaces under general conditions using empirical processes techniques. Our main assumption is termed a variance inequality and…
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
Recent progress towards unraveling the hidden geometric organization of real multiplexes revealed significant correlations across the hyperbolic node coordinates in different network layers, which facilitated applications like trans-layer…
Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…
Persistence diagrams are objects that play a central role in topological data analysis. In the present article, we investigate the local and global geometric properties of spaces of persistence diagrams. In order to do this, we construct a…
We consider Heisenberg groups equipped with a sub-Finsler metric. Using methods of optimal control theory we prove that in this geometric setting the infinite geodesics are horizontal lines under the assumption that the sub-Finsler metric…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
This paper establishes connections between three of the most prominent metrics used in the analysis of persistence diagrams in topological data analysis: the bottleneck distance, Patel's erosion distance, and Bubenik's landscape distance.…
A methodology is developed for data analysis based on empirically constructed geodesic metric spaces. For a probability distribution, the length along a path between two points can be defined as the amount of probability mass accumulated…
We prove upper bounds for the Morse index and number of intersections of min-max geodesics achieving the $p$-widths of a closed surface. A key tool in our analysis is a proof that for a generic set of metrics, the tangent cone at any vertex…
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…