We study a random conductance problem on a d-dimensional discrete torus of size L > 0. The conductances are independent, identically distributed random variables uniformly bounded from above and below by positive constants. The effective conductance AL of the network is a random variable, depending on L, that converges almost surely to the homogenized conductance Ahom. Our main result is a quantitative central limit theorem for this quantity as L → ∞. In particular, we prove there exists some σ > 0 such that dK (Ld/2 A – Ahom/ σ, g) ≲ L–d/2 logd L,where dK is the Kolmogorov distance and gis a standard normal variable. The main achievement of this contribution is the precise asymptotic description of the variance of AL.© 2015 Wiley Periodica...
26 pagesIt is known that a random walk on $\Z^d$ among i.i.d. uniformly elliptic random bond conduct...
For very long bars of size n x n x L, with L >> n, and n up to 18, we calculate the conductivity of...
AbstractWe consider the random conductance model where the underlying graph is an infinite supercrit...
International audienceWe study a random conductance problem on a d-dimensional discrete torus of siz...
Given a resistor network on $Z^d$ with nearest-neighbor conductances, the effective conductance in a...
Published at http://dx.doi.org/10.1214/14-AOP996 in the Annals of Probability (http://www.imstat.org...
ABSTRACT. Given a resistor network on Zd with nearest-neighbor conductances, the effective conductan...
We study the random conductance model on the lattice $Z^d$, i.e. we consider a linear, finite-differ...
We consider a random walk in an i.i.d. Cauchy-tailed conductances en-vironment. We obtain a quenched...
I consider a mathematical model for the conductance of a system formed by a hi- erarchical network o...
We consider resistor networks on Zd where each nearest-neighbor edge is assigned a non-negative rand...
We study a continuous time random walk X in an environment of i.i.d. random conductances μe∈ [0,∞) i...
International audienceThis work is a combined numerical and analytical investigation of the effectiv...
We prove a local limit theorem for nearest neighbours random walks in stationary random environment ...
International audienceWe prove upper bounds on the transition probabilities of random walks with i.i...
26 pagesIt is known that a random walk on $\Z^d$ among i.i.d. uniformly elliptic random bond conduct...
For very long bars of size n x n x L, with L >> n, and n up to 18, we calculate the conductivity of...
AbstractWe consider the random conductance model where the underlying graph is an infinite supercrit...
International audienceWe study a random conductance problem on a d-dimensional discrete torus of siz...
Given a resistor network on $Z^d$ with nearest-neighbor conductances, the effective conductance in a...
Published at http://dx.doi.org/10.1214/14-AOP996 in the Annals of Probability (http://www.imstat.org...
ABSTRACT. Given a resistor network on Zd with nearest-neighbor conductances, the effective conductan...
We study the random conductance model on the lattice $Z^d$, i.e. we consider a linear, finite-differ...
We consider a random walk in an i.i.d. Cauchy-tailed conductances en-vironment. We obtain a quenched...
I consider a mathematical model for the conductance of a system formed by a hi- erarchical network o...
We consider resistor networks on Zd where each nearest-neighbor edge is assigned a non-negative rand...
We study a continuous time random walk X in an environment of i.i.d. random conductances μe∈ [0,∞) i...
International audienceThis work is a combined numerical and analytical investigation of the effectiv...
We prove a local limit theorem for nearest neighbours random walks in stationary random environment ...
International audienceWe prove upper bounds on the transition probabilities of random walks with i.i...
26 pagesIt is known that a random walk on $\Z^d$ among i.i.d. uniformly elliptic random bond conduct...
For very long bars of size n x n x L, with L >> n, and n up to 18, we calculate the conductivity of...
AbstractWe consider the random conductance model where the underlying graph is an infinite supercrit...