Related papers: Statistics of geodesics in large quadrangulations
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n…
In this note we show that for any hyperbolic surface S, the number of geodesics of length bounded above by L in the mapping class group orbit of a fixed closed geodesic with a single double point is asymptotic to L raised to the dimension…
An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…
In classical fixed point and coincidence theory the notion of Nielsen numbers has proved to be extremely fruitful. Here we extend it to pairs (f_1, f_2) of maps between manifolds of arbitrary dimensions. This leads to estimates of the…
We consider an infinite graph with the vertex set $\mathbb{Z}^2$ and edges connecting the vertices iff the Euclidean distance between the respective points is an integer, and the points do not lie on the same horizontal or vertical.…
It is believed that for metric-like models in the KPZ class the following property holds: with probability one, starting from any point, there are at most two semi-infinite geodesics with the same direction that do not coalesce. Until now,…
We show that simple random walks on (non-trivial) relatively hyperbolic groups stay $O(\log(n))$-close to geodesics, where $n$ is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class…
We will develop simple relations between the arc-lengths of a pair of geodesics that share common end-points. The two geodesics differ only by the requirement that one is constrained to lie in a subspace of the parent manifold. We will…
Probability measures on the sphere form an important class of statistical models and are used, for example, in modeling directional data or shapes. Due to their widespread use, but also as an algorithmic building block, efficient sampling…
Suppose that the surfaces K0 and Kr are the boundaries of two convex, complete, connected C^2 bodies in R^3. Assume further that the (Euclidean) distance between any point x in Kr and K0 is always r (r > 0). For x in Kr, let {\Pi}(x) denote…
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive…
In this paper we study fundamental properties of geodesic mappings with respect to the smoothness class of metrics. We show that geodesic mappings preserve the smoothness class of metrics. We study geodesic mappings of Einstein spaces.
Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…
Let $F$ be a lower semicontinuous, 1-homogeneous positive function defined on $\mathbf{R}^n$. We provide a characterization of absolutely continuous paths that minimize the anisotropic $F$-length between two points. The characterization is…
Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between…
A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph…
We prove that every Teichmuller geodesic of a finite type surface contains a string of intersecting long, thick and dominant segments, such that the distance between consecutive segments is bounded. This is key to obtaining some results…