SearcharxivSearch

arXiv · 1103.4591

Quantitative version of the Kipnis-Varadhan theorem and Monte Carlo approximation of homogenized coefficients

Abstract

This article is devoted to the analysis of a Monte Carlo method to approximate effective coefficients in stochastic homogenization of discrete elliptic equations. We consider the case of independent and identically distributed coefficients, and adopt the point of view of the random walk in a random environment. Given some final time t>0, a natural approximation of the homogenized coefficients is given by the empirical average of the final squared positions re-scaled by t of n independent random walks in n independent environments. Relying on a quantitative version of the Kipnis-Varadhan theorem combined with estimates of spectral exponents obtained by an original combination of PDE arguments and spectral theory, we first give a sharp estimate of the error between the homogenized coefficients and the expectation of the re-scaled final position of the random walk in terms of t. We then complete the error analysis by quantifying the fluctuations of the empirical average in terms of n and t, and prove a large-deviation estimate, as well as a central limit theorem. Our estimates are optimal, up to a logarithmic correction in dimension 2.

Explore related subjects

Keep this discovery

BibTeXRIS

Antoine Gloria, Jean-Christophe Mourrat. 2011-03-23. Quantitative version of the Kipnis-Varadhan theorem and Monte Carlo approximation of homogenized coefficients. https://doi.org/10.1214/12-aap880

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR