English
Related papers

Related papers: Long-range first-passage percolation on the torus

200 papers

The nonlinear propagation of 3D wave-packets in a 1D Bragg-induced band-gap system, shows that tranverse effects (free space diffraction) affect the interplay of periodicity and nonlinearity, leading to the spontaneous formation of fast and…

Optics · Physics 2008-07-03 A. Di Falco , C. Conti , S. Trillo

For $a>0$ and $b \geq 0$, let $\mathbb{G}_{a,b}$ be the subgraph of $\mathbb{Z}^2$ induced by the vertices between the first coordinate axis and the graph of the function $f = f_{a,b}(u) = a \log (1+u) + b \log(1+\log(1+u))$, $u \geq 0$. It…

Probability · Mathematics 2025-03-07 Michael Damron , Wai-Kit Lam

Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and…

Probability · Mathematics 2020-04-13 Vivek Dewan , Damien Gayet

Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…

Combinatorics · Mathematics 2024-06-26 Maurício Collares , Joshua Erde , Anna Geisler , Mihyun Kang

We study the critical case of first-passage percolation in two dimensions. Letting $(t_e)$ be i.i.d. nonnegative weights assigned to the edges of $\mathbb{Z}^2$ with $\mathbb{P}(t_e=0)=1/2$, consider the induced pseudometric (passage time)…

Probability · Mathematics 2019-12-17 Michael Damron , David Harper

We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random…

Probability · Mathematics 2013-10-17 Sergey Foss , James Martin , Philipp Schmidt

First-passage percolation is a random growth model defined on $\mathbb{Z}^d$ using i.i.d. nonnegative weights $(\tau_e)$ on the edges. Letting $T(x,y)$ be the distance between vertices $x$ and $y$ induced by the weights, we study the random…

Probability · Mathematics 2022-05-20 Michael Damron , Julian Gold , Wai-Kit Lam , Xiao Shen

In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…

Probability · Mathematics 2011-02-25 József Balogh , Béla Bollobás , Hugo Duminil-Copin , Robert Morris

We consider geodesics for first passage percolation (FPP) on $\mathbb{Z}^d$ with iid passage times. As has been common in the literature, we assume that the FPP system satisfies certain basic properties conjectured to be true, and derive…

Probability · Mathematics 2022-05-04 Kenneth S. Alexander

We study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1…

Probability · Mathematics 2016-01-05 Maria Deijfen , Remco van der Hofstad

In first-passage percolation (FPP), one places nonnegative random variables (weights) $(t_e)$ on the edges of a graph and studies the induced weighted graph metric. We consider FPP on $\mathbb{Z}^d$ for $d \geq 2$ and analyze the geometric…

Probability · Mathematics 2020-03-09 Gerandy Brito , Michael Damron , Jack Hanson

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 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

We define a random graph obtained via connecting each point of $\mathbb{Z}^d$ independently to a fixed number $1 \leq k \leq 2d$ of its nearest neighbors via a directed edge. We call this graph the directed $k$-neighbor graph. Two natural…

Probability · Mathematics 2024-04-16 Benedikt Jahnel , Jonas Köppl , Bas Lodewijks , András Tóbiás

We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…

Probability · Mathematics 2014-01-31 Marek Biskup

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 prove exponential concentration in i.i.d. first-passage percolation in $Z^d$ for all $d \geq 2$ and general edge-weights $(t_e)$. Precisely, under an exponential moment assumption $E e^{\alpha t_e}< \infty$ for some $\alpha>0$) on the…

Probability · Mathematics 2014-11-27 Michael Damron , Jack Hanson , Philippe Sosoe

Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…

Probability · Mathematics 2007-08-06 David J. Aldous , Shankar Bhamidi

We investigate the diffusive motion of an overdamped classical particle in a 1D random potential using the mean first-passage time formalism and demonstrate the efficiency of this method in the investigation of the large-time dynamics of…

Superconductivity · Physics 2009-10-31 D. A. Gorokhov , G. Blatter

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