English
Related papers

Related papers: First contact percolation

200 papers

In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a penalty factor polynomial in their expected degrees. Based on…

Probability · Mathematics 2024-10-03 Júlia Komjáthy , John Lapinskas , Johannes Lengler , Ulysse Schaller

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

Statistical Mechanics · Physics 2015-05-13 R. Juhász , G. Ódor

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…

Probability · Mathematics 2012-10-26 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra

The first passage time for a single diffusing particle has been studied extensively, but the first passage time of a system of many diffusing particles, as is often the case in physical systems, has received little attention until recently.…

Statistical Mechanics · Physics 2024-11-22 Jacob B. Hass , Ivan Corwin , Eric I. Corwin

We consider the first passage percolation model on the square lattice. In this model, $\{t(e): e{an edge of}{\bf Z}^2 \}$ is an independent identically distributed family with a common distribution $F$. We denote by $T({\bf 0}, v)$ the…

Probability · Mathematics 2007-05-23 Yu Zhang

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…

Probability · Mathematics 2015-08-18 Michael Damron , Wai-Kit Lam , Xuan Wang

We study the shape fluctuation in the first passage percolation on $\mathbb{Z}^d$. It is known that it diverges when the distribution obeys Bernoulli in [Yu Zhang. The divergence of fluctuations for shape in first passage percolation.…

Probability · Mathematics 2021-03-26 Shuta Nakajima

Consider $\Xi$ a homogeneous Poisson point process on $\mathbb{R}^d$ ($d\geq 2$) with unit intensity with respect to the Lebesgue measure. For $\varepsilon\geq 0$, we define the Boolean model $\Sigma_{p, \varepsilon}$ as the union of the…

Probability · Mathematics 2025-02-11 Anne-Laure Basdevant , Jean-Baptiste Gouéré , Marie Théret

Applications of first passage times in stochastic processes arise across a wide range of length and time scales in biological settings. After an initial technical overview, we survey representative applications and their corresponding…

Statistical Mechanics · Physics 2026-05-12 Tom Chou , Maria R. D'Orsogna

For rotationally invariant first passage percolation (FPP) on the plane, we use a multi-scale argument to prove stretched exponential concentration of the first passage times at the scale of the standard deviation. Our results are proved…

Probability · Mathematics 2023-12-22 Riddhipratim Basu , Vladas Sidoravicius , Allan Sly

We study first passage percolation (FPP) on a Gromov-hyperbolic group $G$ with boundary $\partial G$ equipped with the Patterson-Sullivan measure $\nu$. We associate an i.i.d.\ collection of random passage times to each edge of a Cayley…

Probability · Mathematics 2024-12-24 Riddhipratim Basu , Mahan Mj

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

We consider the boundary crossing problem for time-homogeneous diffusions and general curvilinear boundaries. Bounds are derived for the approximation error of the one-sided (upper) boundary crossing probability when replacing the original…

Probability · Mathematics 2007-08-28 A. N. Downes , K. Borovkov

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

Probability · Mathematics 2015-04-28 Daniel Ahlberg

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

Probability · Mathematics 2025-12-18 Remco van der Hofstad

One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…

Probability · Mathematics 2024-03-26 Júlia Komjáthy , John Lapinskas , Johannes Lengler , Ulysse Schaller

Advection and dispersion in highly heterogeneous environments involving interfacial discontinuities in the corresponding drift and dispersion rates are described through disparate examples from the physical and biological sciences. A…

Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…

Probability · Mathematics 2022-10-25 Nils Detering , Thilo Meyer-Brandis , Konstantinos Panagiotou

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