Related papers: Geodesic paths in the finite dimensional unit sphe…
We consider the problem of finding embedded closed geodesics on the two-sphere with an incomplete metric defined outside a point. Various techniques including curve shortening methods are used.
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…
Let x and y be two (not necessarily distinct) points on a closed Riemannian manifold M of dimension n. According to a celebrated theorem by J.P. Serre there exist infinitely many geodesics between x and y. The length of the shortest of…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
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…
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…
The paper is a study of geodesic in two-dimensional pseudo-Riemannian metrics. Firstly, the local properties of geodesics in a neighborhood of generic parabolic points are investigated. The equation of the geodesic flow has singularities at…
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
In first-passage percolation, we place i.i.d. continuous weights at the edges of Z^2 and consider the weighted graph metric. A distance-minimizing path between points x and y is called a geodesic, and a bigeodesic is a doubly-infinite path…
Path sets are spaces of one-sided infinite symbol sequences associated to pointed graphs (G_v_0), which are edge-labeled directed graphs G with a distinguished vertex v_0. Such sets arise naturally as address labels in geometric fractal…
We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…
Probabilistic frames are a generalization of finite frames into the Wasserstein space of probability measures with finite second moment. We introduce new probabilistic definitions of duality, analysis, and synthesis and investigate their…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
We study the shortest geodesics on flat cone spheres, i.e. flat metrics on the sphere with conical singularities. The length of the shortest geodesic between two singular points can be treated as a function on the moduli space of flat cone…
A general definition of the curves and geodesics associated with a given connection on a quantized manifold is given. In the particular case of the functional quantization we define geodesics in the same way as in the classical case and we…
Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…
In this paper we establish a relationship between geodesic nets and critical points of the distance function. We bound the number of balanced points for certain minimizing geodesic nets on manifolds homeomorphic to the $n$-sphere. We also…
We construct a linear system on a general curve in a totally geodesic subvariety of the moduli space of curves. As a consequence, we obtain rank bounds for totally geodesic subvarieties of dimension at least two. Furthermore, we classify…