English
Related papers

Related papers: First Passage Percolation with nonidentical passag…

200 papers

We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…

Statistical Mechanics · Physics 2009-11-11 S Condamin , O. Benichou , M. Moreau

Let $\{X_{v}:v\in\mathbb{Z}^d\}$ be i.i.d. random variables. Let $S(\pi)=\sum_{v\in\pi}X_v$ be the weight of a self-avoiding lattice path $\pi$. Let \[M_n=\max\{S(\pi):\pi\text{ has length }n\text{ and starts from the origin}\}.\] We are…

Probability · Mathematics 2024-01-30 Yinshan Chang , Anqi Zheng

As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…

Condensed Matter · Physics 2009-10-22 Jysoo Lee , Joel Koplik

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 pursue the study of a random coloring first passage percolation model introduced by Fontes and Newman. We prove that the asymptotic shape of this first passage percolation model continuously depends on the law of the coloring. The proof…

Probability · Mathematics 2011-12-26 Julie Scholler

In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…

Probability · Mathematics 2023-04-25 Hugo Vanneuville

We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial…

Statistical Mechanics · Physics 2008-05-16 David P. Sanders , Hernán Larralde

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…

Probability · Mathematics 2026-05-25 Maxime Marivain

We consider time correlation for KPZ growth in 1+1 dimensions in a neighborhood of a characteristics. We prove convergence of the covariance with droplet, flat and stationary initial profile. In particular, this provides a rigorous proof of…

Mathematical Physics · Physics 2019-01-30 Patrik L. Ferrari , Alessandra Occelli

Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…

Statistical Mechanics · Physics 2021-06-02 Aanjaneya Kumar , Peter Grassberger , Deepak Dhar

We consider a first-passage percolation model on a Delaunay triangulation of the plane. In this model each edge is independently equipped with a nonnegative random variable, with distribution function F, which is interpreted as the time it…

Probability · Mathematics 2011-08-15 Leandro P. R. Pimentel

A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…

Probability · Mathematics 2014-08-13 Matija Vidmar

We study the number $N\_n$ of open paths of length $n$ in supercritical oriented percolation on $\Zd \times \N$, with $d \ge 1$. We prove that on the percolation event $\{\inf N\_n\textgreater{}0\}$, $N\_n^{1/n}$ almost surely converges to…

Probability · Mathematics 2015-03-06 Olivier Garet , Jean-Baptiste Gouéré , Régine Marchand

Consider a simple symmetric random walk on the integer lattice $\mathbb{Z}$. Let $E(n)$ denote a favorite edge of the random walk at time $n$. In this paper, we study the escape rate of $E(n)$, and show that almost surely…

Probability · Mathematics 2023-03-24 Chen-Xu Hao

We consider the standard first passage percolation on $\mathbb{Z}^{d}$: with each edge of the lattice we associate a random capacity. We are interested in the maximal flow through a cylinder in this graph. Under some assumptions Kesten…

Probability · Mathematics 2009-07-29 Marie Théret

We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…

Probability · Mathematics 2012-05-25 Donald Dawson , Luis Gorostiza

We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…

Combinatorics · Mathematics 2015-07-07 Michael Krivelevich

We provide an exact formula for the mean first-passage time (MFPT) to a target at the origin for a single particle diffusing on a $d$-dimensional hypercubic {\em lattice} starting from a fixed initial position $\vec R_0$ and resetting to…

Statistical Mechanics · Physics 2026-04-30 Alexander K. Hartmann , Satya N. Majumdar

We celebrate the 50th anniversary of one the most classical models in probability theory. In this survey, we describe the main results of first passage percolation, paying special attention to the recent burst of advances of the past 5…

Probability · Mathematics 2018-04-11 Antonio Auffinger , Michael Damron , Jack Hanson

Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…

Data Structures and Algorithms · Computer Science 2025-06-11 Kritkorn Karntikoon , Yiheng Shen , Sreenivas Gollapudi , Kostas Kollias , Aaron Schild , Ali Sinop