AbstractEquip the edges of the lattice Z2 with i.i.d. random capacities. We prove a law of large numbers for the maximal flow crossing a rectangle in R2 when the side lengths of the rectangle go to infinity. The value of the limit depends on the asymptotic behaviour of the ratio of the height of the cylinder over the length of its basis. This law of large numbers extends the law of large numbers obtained in Grimmett and Kesten (1984) [6] for rectangles of particular orientation
The overall presentation has been changed. To appear in Confluentes MathematiciInternational audienc...
Given a network 𝒩, and a collection 𝒱 of unordered pairs of vertices in 𝒩, a corres...
We consider the sums TN = Nn=1N F(Sn) where Sn is a random walk on ℤd and F : ℤd → R is a global obs...
AbstractEquip the edges of the lattice Z2 with i.i.d. random capacities. We prove a law of large num...
We consider the standard first passage percolation model in ℤd for d ≥ 2 and we study the maximal fl...
AbstractWe consider the standard first-passage percolation in Zd for d≥2 and we denote by ϕnd−1,h(n)...
We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on ...
Le sujet de cette thèse est l'étude du flux maximal en percolation de premier passage dans le graphe...
AbstractFor each point of the integer lattice Zd, let X and Y be independent identically distributed...
60 pages, 22 figuresWe consider the standard first passage percolation model in the rescaled graph $...
In this thesis, we study the models of percolation and first passage percolation on the graph Z^d, d...
We construct new examples of cylinder flows, given by skew product extensions of irrational rotation...
We consider the standard first passage percolation model on Z^d with a distribution G on R+ that adm...
We prove limit theorems and variance estimates for quantities related to ponds and outlets for 2D in...
Over a -mixing dynamical system we consider the function (Cn)/n in the limit of large n, where (Cn) ...
The overall presentation has been changed. To appear in Confluentes MathematiciInternational audienc...
Given a network 𝒩, and a collection 𝒱 of unordered pairs of vertices in 𝒩, a corres...
We consider the sums TN = Nn=1N F(Sn) where Sn is a random walk on ℤd and F : ℤd → R is a global obs...
AbstractEquip the edges of the lattice Z2 with i.i.d. random capacities. We prove a law of large num...
We consider the standard first passage percolation model in ℤd for d ≥ 2 and we study the maximal fl...
AbstractWe consider the standard first-passage percolation in Zd for d≥2 and we denote by ϕnd−1,h(n)...
We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on ...
Le sujet de cette thèse est l'étude du flux maximal en percolation de premier passage dans le graphe...
AbstractFor each point of the integer lattice Zd, let X and Y be independent identically distributed...
60 pages, 22 figuresWe consider the standard first passage percolation model in the rescaled graph $...
In this thesis, we study the models of percolation and first passage percolation on the graph Z^d, d...
We construct new examples of cylinder flows, given by skew product extensions of irrational rotation...
We consider the standard first passage percolation model on Z^d with a distribution G on R+ that adm...
We prove limit theorems and variance estimates for quantities related to ponds and outlets for 2D in...
Over a -mixing dynamical system we consider the function (Cn)/n in the limit of large n, where (Cn) ...
The overall presentation has been changed. To appear in Confluentes MathematiciInternational audienc...
Given a network 𝒩, and a collection 𝒱 of unordered pairs of vertices in 𝒩, a corres...
We consider the sums TN = Nn=1N F(Sn) where Sn is a random walk on ℤd and F : ℤd → R is a global obs...