We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability p > p_c (d), where p_c (d) denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite open cluster C_p [11]. We are interested in the regularity properties of the chemical distance for supercritical Bernoulli percolation. The chemical distance between two points x, y ∈ C_p corresponds to the length of the shortest path in C_p joining the two points. The chemical distance between 0 and nx grows asymptotically like nμ_p (x). We aim to study the regularity properties of the map p → μ_p in the supercritical regime. This may be seen as a special case of first passage percolation where the distrib...
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i....
Abstract: We study long-range Bernoulli percolation on Zd in which each two vertices x and y are con...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...
We consider an i.i.d. supercritical bond percolation on ℤd, every edge is open with a probability p ...
The chemical distance D(x,y) is the length of the shortest open path between two points x and y in a...
We consider the standard model of i.i.d. first passage percolation on Zd given a distribution G on [...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
International audienceWe consider two different objects on super-critical Bernoulli percolation on $...
We prove large deviation estimates at the correct order for the graph distance of two sites lying in...
Funder: University of CambridgeAbstract: Let G be a connected, locally finite, transitive graph, and...
10 pagesIn this paper, we consider Bernoulli percolation on a locally finite, transitive and infinit...
Abstract. We obtain Gaussian upper and lower bounds on the transition density qt(x; y) of the contin...
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical pe...
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i....
Abstract: We study long-range Bernoulli percolation on Zd in which each two vertices x and y are con...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...
We consider an i.i.d. supercritical bond percolation on ℤd, every edge is open with a probability p ...
The chemical distance D(x,y) is the length of the shortest open path between two points x and y in a...
We consider the standard model of i.i.d. first passage percolation on Zd given a distribution G on [...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
Let #mu#(F) be the time constant of first-passage percolation on the square lattice with underlying ...
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
International audienceWe consider two different objects on super-critical Bernoulli percolation on $...
We prove large deviation estimates at the correct order for the graph distance of two sites lying in...
Funder: University of CambridgeAbstract: Let G be a connected, locally finite, transitive graph, and...
10 pagesIn this paper, we consider Bernoulli percolation on a locally finite, transitive and infinit...
Abstract. We obtain Gaussian upper and lower bounds on the transition density qt(x; y) of the contin...
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical pe...
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i....
Abstract: We study long-range Bernoulli percolation on Zd in which each two vertices x and y are con...
We construct a nearest-neighbor process {Sn} on Z that is less predictable than simple random walk, ...