Related papers: Geodesic trees in last passage percolation and som…
We consider i.i.d. first-passage percolation (FPP) on the two-dimensional square lattice, in the critical case where edge-weights take the value zero with probability $\tfrac{1}{2}$. Critical FPP is unique in that the Euclidean lengths of…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
We study first-passage percolation on Z2, where the edge weights are given by a translation-ergodic distribution, addressing questions related to existence and coalescence of infinite geodesics. Some of these were studied in the late 90's…
We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…
This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…
It is believed that, under very general conditions, bi-infinite geodesics (or bigeodesics) do not exist for planar first and last passage percolation (LPP) models. However, if one endows the model with a natural dynamics, thereby gradually…
Study of the KPZ universality class has seen the emergence of universal objects over the past decade which arise as the scaling limit of the member models. One such object is the directed landscape, and it is known that exactly solvable…
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…
We study geodesics in the Brochette first-passage percolation model, where edges on the same axis-parallel line share a common random passage time, inducing long-range dependence. We focus on the maximal transversal deviation H n of…
Last passage percolation (LPP) is a model of a directed metric and a zero-temperature polymer where the main observable is a directed path evolving in a random environment accruing as energy the sum of the random weights along itself. When…
We study first passage percolation on the plane for a family of invariant, ergodic measures on $\mathbb{Z}^2$. We prove that for all of these models the asymptotic shape is the $\ell$-$1$ ball and that there are exactly four infinite…
We consider point to point last passage times to every vertex in a neighbourhood of size $\delta N^{\frac{2}{3}}$, distance $N$ away from the starting point. The increments of these last passage times in this neighbourhood are shown to be…
Shortest paths in treespace, which represent minimal deformations between trees, are unique and can be computed in polynomial time. The ability to quickly compute shortest paths has enabled new approaches for statistical analysis of…
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 consider a last passage percolation model in dimension $1+1$ with potential given by the product of a spatial i.i.d. potential with symmetric bounded distribution and an independent i.i.d. in time sequence of signs. We assume that the…
We investigate intersections of geodesic lines in $H^2$ and in an associated tree T, proving the following result. Let M be a punctured hyperbolic torus and let $\gamma$ be a closed geodesic in M. Any edge of any triangle formed by distinct…
We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…
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…
In this survey article we consider the directed last-passage percolation model on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside of the class of exactly solvable models. We show how…