English
Related papers

Related papers: First passage percolation preserves sublinearly Mo…

200 papers

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…

Probability · Mathematics 2024-06-17 Yuri Bakhtin , Douglas Dow

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

For First Passage Percolation in Z^d with large d, we construct a path connecting the origin to {x_1 =1}, whose passage time has optimal order \log d/d. Besides, an improved lower bound for the "diagonal" speed of the cluster combined with…

Probability · Mathematics 2011-02-24 Olivier Couronné , Nathanaël Enriquez , Lucas Gerin

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…

Probability · Mathematics 2010-09-14 B. T. Graham

This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…

Probability · Mathematics 2021-10-04 Erik Bates

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

We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…

Probability · Mathematics 2015-06-04 Enrico Baroni , Remco van der Hofstad , Julia Komjathy

The Poisson clumping heuristic has lead Aldous to conjecture the value of the first passage percolation on the hypercube in the limit of large dimensions. Aldous' conjecture has been rigorously confirmed by Fill and Pemantle [Annals of…

Probability · Mathematics 2018-04-10 Nicola Kistler , Adrien Schertzer , Marius A. Schmidt

The Euclidean first-passage percolation model of Howard and Newman is a rotationally invariant percolation model built on a Poisson point process. It is known that the passage time between 0 and $ne_1$ obeys a diffusive upper bound:…

Probability · Mathematics 2020-09-14 Megan Bernstein , Michael Damron , Torin Greenwood

We investigate a novel first-passage percolation model, referred to as the Brochette first-passage percolation model, where the passage times associated with edges lying on the same line are equal. First, we establish a point-to-point…

Probability · Mathematics 2026-04-15 Maxime Marivain

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…

Probability · Mathematics 2025-10-23 Sam McKeown

We study first-passage percolation (FPP) on the square lattice. The model is defined using i.i.d. nonnegative random edge-weights $(t_e)$ associated to the nearest neighbor edges of $\mathbb{Z}^2$. The passage time between vertices $x$ and…

Probability · Mathematics 2023-08-22 Michael Damron , Jack Hanson , David Harper , Wai-Kit Lam

We consider the Bernoulli first-passage percolation on $\mathbb Z^d (d\ge 2)$. That is, the edge passage time is taken independently to be 1 with probability $1-p$ and 0 otherwise. Let ${\mu(p)}$ be the time constant. We prove in this paper…

Probability · Mathematics 2008-07-13 Xian-Yuan Wu , Ping Feng

We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…

Probability · Mathematics 2026-02-02 Benedikt Jahnel , Lukas Lüchtrath , Anh Duc Vu

First passage percolation with recovery is a process aimed at modeling the spread of epidemics. On a graph $G$ place a red particle at a reference vertex $o$ and colorless particles (seeds) at all other vertices. The red particle starts…

Probability · Mathematics 2024-10-23 Elisabetta Candellero , Tom Garcia-Sanchez

We consider first passage percolation on certain isotropic random graphs in $\mathbb{R}^d$. We assume exponential concentration of passage times $T(x,y)$, on some scale $\sigma_r$ whenever $|y-x|$ is of order $r$, with $\sigma_r$ "growning…

Probability · Mathematics 2021-09-03 Kenneth S. Alexander

We study first-passage percolation in two dimensions, using measures mu on passage times with b:=inf supp(mu) >0 and mu({b})=p \geq p_c, the threshold for oriented percolation. We first show that for each such mu, the boundary of the limit…

Probability · Mathematics 2013-09-18 Antonio Auffinger , Michael Damron

We study first passage percolation (FPP) with stationary edge weights on Cayley graphs of finitely generated virtually nilpotent groups. Previous works of Benjamini-Tessera and Cantrell-Furman show that scaling limits of such FPP are given…

Probability · Mathematics 2021-10-04 Antonio Auffinger , Christian Gorski

Polymer translocation across a corrugated channel is a paradigmatic stochastic process encountered in diverse systems. The instance of time when a polymer first arrives to some prescribed location defines an important characteristic time…

Soft Condensed Matter · Physics 2019-01-30 Paolo Malgaretti , Gleb Oshanin

We investigate first-passage percolation on the lattice $\Z^d$ for dimensions $d \geq 2$. Each edge $e$ of the graph is assigned an independent copy of a non-negative random variable $\tau$. We only assume $\P[\tau=0]0$ is explicit) for the…

Probability · Mathematics 2024-07-26 Olivier Durieu , Jean-Baptiste Gouéré , Antonin Jacquet