English
Related papers

Related papers: Long-range last-passage percolation on the line

200 papers

In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…

Probability · Mathematics 2024-12-05 Shankar Bhamidi , Rick Durrett , Xiangying Huang

We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…

Probability · Mathematics 2017-04-19 Anders Martinsson

Consider standard first-passage percolation on $\mathbb Z^d$. We study the lower-tail large deviations of the rescaled random metric $\widehat{\mathbf T}_n$ restricted to a box. If all exponential moments are finite, we prove that…

Probability · Mathematics 2024-12-05 Julien Verges

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…

Probability · Mathematics 2025-02-11 Pranay Agarwal , Riddhipratim Basu

We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common distribution is compactly supported in $(0,\infty)$ with a uniformly-positive density. Given $\epsilon>0$ and $v\in\mathbb Z^d$, which…

Probability · Mathematics 2023-10-16 Barbara Dembin , Dor Elboim , Ron Peled

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…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation. Assume that the graph is infinite and of bounded degree.…

Probability · Mathematics 2025-12-08 Dominic Bair , Sagnik Jana , Yulan Qing

We consider a system of N particles with a stochastic dynamics introduced by Brunet and Derrida. The particles can be interpreted as last passage times in directed percolation on {1,...,N} of mean-field type. The particles remain grouped…

Probability · Mathematics 2015-06-04 Francis Comets , Jeremy Quastel , Alejandro F. Ramirez

First-passage percolation is a random growth model which has a metric structure. An infinite geodesic is an infinite sequence whose all sub-sequences are shortest paths. One of the important quantity is the number of infinite geodesics…

Probability · Mathematics 2018-07-17 Shuta Nakajima

We study the last passage time in geometric last passage percolation (LPP). As the system size increases, we derive precise large deviation probabilities -- up to and including the constant terms -- for both the lower and upper tails. A key…

Probability · Mathematics 2025-10-21 Sung-Soo Byun , Christophe Charlier , Philippe Moreillon , Nick Simm

We study the behavior of the optimal path between two sites separated by a distance $r$ on a $d$-dimensional lattice of linear size $L$ with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a…

Disordered Systems and Neural Networks · Physics 2016-08-16 Eduardo López , Sergey V. Buldyrev , Lidia A. Braunstein , Shlomo Havlin , H. Eugene Stanley

The conjectured limit of last passage percolation is a scale-invariant, independent, stationary increment process with respect to metric composition. We prove this for Brownian last passage percolation. We construct the Airy sheet and…

Probability · Mathematics 2024-04-24 Duncan Dauvergne , Janosch Ortmann , Balint Virag

For the exactly solvable model of exponential last passage percolation on $\mathbb{Z}^2$, consider the geodesic $\Gamma_n$ joining $(0,0)$ and $(n,n)$ for large $n$. It is well known that the transversal fluctuation of $\Gamma_n$ around the…

Probability · Mathematics 2021-01-06 Riddhipratim Basu , Manan Bhatia

A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…

Probability · Mathematics 2019-08-06 Lasse Leskelä , Hoa Ngo

We introduce and study derivatives in first-passage percolation with edge weights given by i.i.d. random variables supported on ${a,b}$. We show that the variance of the passage time can be expressed in terms of these derivatives. We…

Probability · Mathematics 2026-05-14 Ivan Matic , Rados Radoicic , Dan Stefanica

In first-passage percolation (FPP), one assigns i.i.d.~weights to the edges of the cubic lattice $\mathbb{Z}^d$ and analyzes the induced weighted graph metric. If $T(x,y)$ is the distance between vertices $x$ and $y$, then a primary…

Probability · Mathematics 2019-06-19 Michael Damron , Jack Hanson , Christian Houdré , Chen Xu

We consider the first passage percolation model on $\mathbf{Z}^2$. In this model, we assign independently to each edge $e$ a passage time $t(e)$ with a common distribution $F$. Let $T(u,v)$ be the passage time from $u$ to $v$. In this…

Probability · Mathematics 2011-11-10 Yu Zhang

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…

Probability · Mathematics 2020-10-13 Shirshendu Ganguly , Alan Hammond

In first-passage percolation, we assign i.i.d.~nonnegative weights $(t_e)$ to the nearest-neighbor edges of $\mathbb{Z}^d$ and study the induced pseudometric $T = T(x,y)$. In this paper, we focus on geodesics, or optimal paths for $T$, and…

Probability · Mathematics 2025-05-13 Michael Damron , Jack Hanson , Christopher Janjigian , Wai-Kit Lam , Xiao Shen

Directed last passage percolation models on the plane, where one studies the weight as well as the geometry of optimizing paths (called polymers) in a field of i.i.d. weights, are paradigm examples of models in the KPZ universality class.…

Probability · Mathematics 2017-11-01 Riddhipratim Basu , Shirshendu Ganguly , Allan Sly