Related papers: Statistics of geodesics in large quadrangulations
Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…
We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…
We derive the length and area generating function of planar height-restricted forward-moving discrete paths of increments +1, 0, or -1 with arbitrary starting and ending points, the so-called Motzkin meanders, and the more general…
Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…
The scattering data of a Riemannian manifold with boundary record the incoming and outgoing directions of each geodesic passing through. We show that the scattering data of a generic Riemannian surface with no trapped geodesics and no…
Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…
We present two algorithms for computing the geodesic distance between phylogenetic trees in tree space, as introduced by Billera, Holmes, and Vogtmann (2001). We show that the possible combinatorial types of shortest paths between two trees…
For the pants graph, there is little known about the behaviour of geodesics, as opposed to quasigeodesics. Brock-Masur-Minsky showed that geodesics or geodesic segments connecting endpoints satisfying a bounded combinatorics condition, such…
Studying geodesics in Cayley graphs of groups has been a very active area of research over the last decades. We introduce the notion of a uniquely labelled geodesic, abbreviated with u.l.g. These will be studied first in finite Coxeter…
Wasserstein distance, especially among symmetric positive-definite matrices, has broad and deep influences on development of artificial intelligence (AI) and other branches of computer science. A natural idea is to describe the geometry of…
We show convergence of small eigenvalues for geometrically finite hyperbolic $n$-manifolds under strong limits. For a class of convergent convex sets in a strongly convergent sequence of Kleinian groups, we use the spectral gap of the limit…
We show that, in the Teichm\"uller metric, "thin-framed triangles are thin"---that is, under suitable hypotheses, the variation of geodesics obeys a hyperbolic-like inequality. This theorem has applications to the study of random walks on…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability. In particular we study the behavior of very short paths. For $d(n)=n^{o(1)}$ we show that $G(n,d(n)/n)$ has asymptotically almost surely…
A well-known question in planar first-passage percolation concerns the convergence of the empirical distribution of weights as seen along geodesics. We demonstrate this convergence for an explicit model, directed last-passage percolation on…
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…
For exponential last passage percolation on the plane we analyse the probability that the point-to-line geodesic exhibits an atypically large transversal fluctuation at the endpoint as well as the probability that the point-to-point…
We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…