English
Related papers

Related papers: First-passage percolation on width-two stretches w…

200 papers

In this paper we explore first passage percolation (FPP) on the Erd\H{o}s-R\'enyi random graph $G_n(p_n)$, where each edge is given an independent exponential edge weight with rate 1. In the sparse regime, i.e., when $np_n\to \lambda>1,$ we…

Probability · Mathematics 2010-05-25 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra

In first-passage percolation (FPP), we let $(\tau_v)$ be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If $F$ is the distribution function of $\tau_v$, there are…

Probability · Mathematics 2021-08-31 Michael Damron , Jack Hanson , David Harper , Wai-Kit Lam

Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolation, p=e/n and p=1/n are the respective critical…

Probability · Mathematics 2007-05-23 James Allen Fill , Robin Pemantle

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

We consider a wide class of ergodic first passage percolation processes on Z^2 and prove that there exist at least four one-sided geodesics a.s. We also show that coexistence is possible with positive probability in a four color…

Probability · Mathematics 2007-11-19 Christopher Hoffman

First-passage percolation is a random growth model defined using i.i.d. edge-weights $(t_e)$ on the nearest-neighbor edges of $\mathbb{Z}^d$. An initial infection occupies the origin and spreads along the edges, taking time $t_e$ to cross…

Probability · Mathematics 2017-09-28 Michael Damron , Jack Hanson , Wai-Kit Lam

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…

Probability · Mathematics 2007-05-23 James B. Martin

We consider directed first passage percolation on the integer lattice, with time constant $\mu$ and passage time $a_{0n}$ from the origin to $(n,0,...,0)$. It is shown that under certain conditions on the passage time distribution, $Ea_{0n}…

Probability · Mathematics 2011-05-19 Kenneth S. Alexander

In first-passage percolation, one places nonnegative i.i.d. random variables (T(e)) on the edges of Z^d. A geodesic is an optimal path for the passage times T(e). Consider a local property of the time environment. We call it a pattern. We…

Probability · Mathematics 2023-10-09 Antonin Jacquet

We study a random growth model on $\R^d$ introduced by Deijfen. This is a continuous first-passage percolation model. The growth occurs by means of spherical outbursts with random radii in the infected region. We aim at finding conditions…

Probability · Mathematics 2007-07-11 Jean-Baptiste Gouere , Regine Marchand

We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on [0, +$\infty$] (including +$\infty$). We suppose that G({0}) > 1 -- p\_c(d), i.e., the edges of positive passage time are in the subcritical…

Probability · Mathematics 2018-03-13 Barbara Dembin , Marie Théret

We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen…

Probability · Mathematics 2018-12-05 Steffen Dereich , Marcel Ortgiese

We study local modifications of the graph distance in large random triangulations. Our main results show that, in large scales, the modified distance behaves like a deterministic constant $\mathbf{c}~\in~(0,\infty)$ times the usual graph…

Probability · Mathematics 2015-11-16 Nicolas Curien , Jean-François Le Gall

We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph…

Probability · Mathematics 2017-11-09 Daniel Ahlberg , Maria Deijfen , Svante Janson

We study the first passage times of discrete-time branching random walks in ${\mathbb R}^d$ where $d\geq 1$. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage…

Probability · Mathematics 2026-01-06 Jose Blanchet , Wei Cai , Shaswat Mohanty , Zhenyuan Zhang

We investigate the moderate and large deviations in first-passage percolation (FPP) with bounded weights on $\mathbb{Z}^d$ for $d \geq 2$. Write $T(\mathbf{x}, \mathbf{y})$ for the first-passage time and denote by $\mu(\mathbf{u})$ the time…

Probability · Mathematics 2025-12-04 Wai-Kit Lam , Shuta Nakajima

We construct an edge-weight distribution for i.i.d. first-passage percolation on $\mathbb{Z}^2$ whose limit shape is not a polygon and whose extreme points are arbitrarily dense in the boundary. Consequently, the associated Richardson-type…

Probability · Mathematics 2013-03-14 Michael Damron , Michael Hochman

Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…

Statistical Mechanics · Physics 2021-08-23 D. B. Wilson , C. H. L. Beentjes

We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…

Probability · Mathematics 2019-03-19 Réka Szabó , Daniel Valesin

We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…

Probability · Mathematics 2025-09-15 Emmanuel Kammerer
‹ Prev 1 3 4 5 6 7 10 Next ›