Related papers: Long-range first-passage percolation on the torus
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…
We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-passage percolation distance concentrates in an…
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…
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…
We consider first passage percolation (FPP) with passage times generated by a general class of models with long-range correlations on $\mathbb{Z}^d$, $d\geq 2$, including discrete Gaussian free fields, Ginzburg-Landau $\nabla \phi$…
In the models of first-passage percolation and directed first-passage percolation on $\mathbb{Z}^d$, we consider a family of i.i.d. random variables indexed by the set of edges of the graph, called passage times. For every vertex $x \in…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…
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…
We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…
This paper discusses first passage percolation and flooding on large weighted sparse random graphs with two types of nodes: active and passive nodes. In mathematical physics passive nodes can be interpreted as closed gates where fluid flow…
In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…
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$,…
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…
In this paper we establish a connection between epidemic models on random networks with general infection times considered in Barbour and Reinert 2013 and first passage percolation. Using techniques developed in Bhamidi, van der Hofstad,…
We study the rate of convergence in the Shape Theorem of first-passage percolation, obtaining the precise asymptotic rate of decay for the probability of linear order deviations under a moment condition. Our results are stated for a given…
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…
We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape…
We study the time constant $\mu(e_{1})$ in first passage percolation on $\mathbb Z^{d}$ as a function of the dimension. We prove that if the passage times have finite mean, $$\lim_{d \to \infty} \frac{\mu(e_{1}) d}{\log d} = \frac{1}{2a},$$…
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…