Related papers: Geodesic Forests in the Last-Passage Percolation
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…
We consider first-passage percolation with i.i.d. non-negative weights coming from some continuous distribution under a moment condition. We review recent results in the study of geodesics in first-passage percolation and study their…
The energy and geometry of maximizing paths in integrable last passage percolation models are governed by the characteristic KPZ scaling exponents of one-third and two-thirds. When represented in scaled coordinates that respect these…
We study the directed last-passage percolation model on the planar integer lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside the class of exactly solvable models. Stationary cocycles are constructed for…
In discrete planar last passage percolation (LPP), random values are assigned independently to each vertex in $\mathbb Z^2$, and each finite upright path in $\mathbb Z^2$ is ascribed the weight given by the sum of values of its vertices.…
We survey some results and applications of last percolation models of which the limiting distribution can be evaluated.
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…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We consider geodesics for first passage percolation (FPP) on $\mathbb{Z}^d$ with iid passage times. As has been common in the literature, we assume that the FPP system satisfies certain basic properties conjectured to be true, and derive…
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…
For exactly solvable models of planar last passage percolation, it is known that geodesics of length $n$ exhibit transversal fluctuations at scale $n^{2/3}$ and matching (up to exponents) upper and lower bounds for the tail probabilities…
A range of first-passage percolation type models are believed to demonstrate the related properties of sublinear variance and superdiffusivity. We show that directed last-passage percolation with Gaussian vertex weights has a sublinear…
In this note we provide a short proof of the distributional equality between last passage percolation with geometric weights along a general down-right path and Schur processes. We do this in both the full-space and half-space settings, and…
This article studies several properties of the half-space last passage percolation, in particular the two-time covariance. We show that, when the two end-points are at small macroscopic distance, then the first order correction to the…
Bi-infinite geodesics are fundamental objects of interest in planar first passage percolation. A longstanding conjecture states that under mild conditions there are almost surely no bigeodesics, however the result has not been proved in any…
We study last passage percolation in a half-quadrant, which we analyze within the framework of Pfaffian Schur processes. For the model with exponential weights, we prove that the fluctuations of the last passage time to a point on the…
We study directed last passage percolation on the first quadrant of the planar square lattice whose weights have general distributions, or equivalently, ./G/1 queues in series. The service time distributions of the servers vary randomly…
We prove a strong law of large numbers for directed last passage times in an independent but inhomogeneous exponential environment. Rates for the exponential random variables are obtained from a discretisation of a speed function that may…
The 1+1 dimensional directed polymers in a Poissonean random environment is studied. For two polymers of maximal length with the same origin and distinct end points we establish that the point of last branching is governed by the exponent…
We consider directed random graphs, the prototype of which being the Barak-Erd\H{o}s graph $\vec G(\mathbb Z, p)$, and study the way that long (or heavy, if weights are present) paths grow. This is done by relating the graphs to certain…