Related papers: Sublinear Morse Geodesics and First Passage Percol…
Every closed hyperbolic geodesic $\gamma$ on the triply--punctured sphere $M =\widehat{{\mathbb C}} - \{0,1,\infty\}$ has a self--intersection number $I(\gamma) \ge 1$ and a combinatorial length $L(\gamma) \ge 2$, the latter defined by the…
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
The directed landscape is a random directed metric on the plane that arises as the scaling limit of metric models in the KPZ universality class. For a pair of points p, q, the disjointness gap G(p; q) measures the shortfall when we optimize…
A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph $G$ is introduced as the task to find a smallest set $S$ of vertices of $G$ such that…
A sublinear biLipschitz equivalence (SBE) between metric spaces is a map from one space to another that distorts distances with bounded multiplicative constants and sublinear additive error. Given any sublinear function $\kappa$,…
The geometry of impulsive pp-waves is explored via the analysis of the geodesic and geodesic deviation equation using the distributional form of the metric. The geodesic equation involves formally ill-defined products of distributions due…
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in…
The directed last-passage percolation (LPP) model with independent exponential times is considered. We complete the study of asymptotic directions of infinite geodesics, started by Ferrari and Pimentel \cite{FP}. In particular, using a…
We show non-existence of non-trivial bi-infinite geodesics in the solvable last-passage percolation model with i.i.d. geometric weights. This gives the first example of a model with discrete weights where non-existence of non-trivial…
A classical result about minimal geodesics on R^2 with Z^2 periodic metric that goes back to H.M. Morse asserts that a minimal geodesic that is asymptotic to a periodic minimal geodesic cannot intersect any periodic minimal geodesic of the…
Considering Riemannian submersions, we find necessary and sufficient conditions for when sub-Riemannian normal geodesics project to curves of constant first geodesic curvature or constant first and vanishing second geodesic curvatures. We…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (G_i) of finite bounded degree graphs such that the rooted r-radius neighbourhood of a random…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
The geodesic flow on a finite discrete q-manifold with or without boundary is defined as as a permutation of its ordered q-simplices. This allows to define geodesic sheets and a notion of sectional curvature.
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
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…