Related papers: Geodesics in persistence diagram space
It has been argued that supersymmetric microstate geometries are classically unstable. One argument for instability involves considering the motion of a massive particle near the ergosurface of such a spacetime. It is shown that the…
We study the nonexpansivity of reflection mappings in geodesic spaces and apply our findings to the averaged alternating reflection algorithm employed in solving the convex feasibility problem for two sets in a nonlinear context. We show…
This paper treats the problem of the merging of formations, where the underlying model of a formation is graphical. We first analyze the rigidity and persistence of meta-formations, which are formations obtained by connecting several rigid…
We study geodesics of the form $\gamma(t)=\pi(\exp(tX)\exp(tY))$, $X,Y\in \fr{g}=\operatorname{Lie}(G)$, in homogeneous spaces $G/K$, where $\pi:G\rightarrow G/K$ is the natural projection. These curves naturally generalise homogeneous…
This paper studies the magnitude homology groups of geodesic metric spaces. We start with a description of the second magnitude homology of a general metric space in terms of the zeroth homology groups of certain simplicial complexes. Then,…
In Mathematics is common to make a mistake and therefore a false conclusion arises. In each case it is important to recognize the mistake in order to avoid a similar one in the future. Geometric figures provide decisive help in order to…
Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show…
Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…
Geodesic distance, commonly called shortest path length, has proved useful in a great variety of disciplines. It has been playing a significant role in search engine at present and so attracted considerable attention at the last few…
Quasimetric spaces form a natural framework to study distance problems with an inherent directional asymmetry. We introduce a simple novel class of quasimetrics on probability simplices, inspired by the Chebyshev distance. It is shown that…
A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family…
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…
In first-passage percolation (FPP), one places nonnegative random variables (weights) $(t_e)$ on the edges of a graph and studies the induced weighted graph metric. We consider FPP on $\mathbb{Z}^d$ for $d \geq 2$ and analyze the geometric…
The usual notion of set-convexity, valid in the classical Euclidean context, metamorphoses into several distinct convexity types in the more general Riemannian setting. By studying this phenomenon in reverse, we characterize complete…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…
We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…
In pregeometry a metric arises as a composite object at large distances. We investigate if its signature, which distinguishes between time and space, could be a result of the dynamics rather than being built in already in the formulation of…
Persistence diagrams, an important summary in topological data analysis, consist of a set of ordered pairs, each with positive multiplicity. Persistence diagrams are obtained via Mobius inversion and may be compared using a one-parameter…