Related papers: The directed landscape
We consider directed first-passage and last-passage percolation on the nonnegative lattice Z_+^d, d\geq2, with i.i.d. weights at the vertices. Under certain moment conditions on the common distribution of the weights, the limits…
We develop a general theory for percolation in directed random networks with arbitrary two point correlations and bidirectional edges, that is, edges pointing in both directions simultaneously. These two ingredients alter the previously…
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…
In this paper we continue our earlier work about topological first passage percolation and answer certain questions asked in our previous paper. Notably, we prove that apart from trivialities, in the generic configuration there exists…
Conserved directed-percolation (C-DP) and the depinning transition of a disordered elastic interface belong to the same universality class as has been proven very recently by Le Doussal and Wiese [Phys. Rev. Lett.~\textbf{114}, 110601…
The finite-size scaling behaviour for percolation and conduction is studied in two-dimensional triangular-shaped random resistor networks at the percolation threshold. The numerical simulations are performed using an efficient star-triangle…
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal non-percolating sets. Additional…
We consider the Busemann process in planar directed first passage percolation. We extend existing techniques to establish the existence of the process in our setting and determine its distribution in a number of integrable models. As…
This paper is a survey of various results and techniques in first passage percolation, a random process modeling a spreading fluid on an infinite graph. The latter half of the paper focuses on the connection between first passage…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
There has recently been much activity within the Kardar-Parisi-Zhang universality class spurred by the construction of the canonical limiting object, the parabolic Airy sheet $\mathcal{S}:\mathbb{R}^2\to\mathbb{R}$ [arXiv:1812.00309]. The…
Directed percolation is one of the generic universality classes for dynamic processes. We study the crossover from isotropic to directed percolation by representing the combined problem as a random cluster model, with a parameter $r$…
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 consider discrete Gaussian free fields with ergodic random conductances on a class of random subgraphs of $\mathbb{Z}^{d}$, $d \geq 2$, including i.i.d.\ supercritical percolation clusters, where the conductances are possibly unbounded…
We introduce and study a class of abstract continuous action minimization problems that generalize continuous first and last passage percolation. In this class of models a limit shape exists. Our main result provides a framework under which…
Consider N Brownian bridges B_i:[-N,N] -> R, B_i(-N) = B_i(N) = 0, 1 <= i <= N, conditioned not to intersect. The edge-scaling limit of this system is obtained by taking a limit as N -> infinity of these curves scaled around (0,2^{1/2} N)…
We study first-passage percolation through related optimization problems over paths of restricted length. The path length variable is in duality with a shift of the weights. This puts into a convex duality framework old observations about…