SearcharxivSearch

arXiv · 1104.1291

An optimal variance estimate in stochastic homogenization of discrete elliptic equations

Abstract

We consider a discrete elliptic equation on the $d$-dimensional lattice $\mathbb{Z}^d$ with random coefficients $A$ of the simplest type: they are identically distributed and independent from edge to edge. On scales large w.r.t. the lattice spacing (i.e., unity), the solution operator is known to behave like the solution operator of a (continuous) elliptic equation with constant deterministic coefficients. This symmetric ``homogenized'' matrix $A_{\mathrm {hom}}=a_{\mathrm {hom}}\operatorname {Id}$ is characterized by $\xi\cdot A_{\mathrm {hom}}\xi=\langle(\xi+\nabla\phi )\cdot A(\xi+\nabla\phi)\rangle$ for any direction $\xi\in\mathbb {R}^d$, where the random field $\phi$ (the ``corrector'') is the unique solution of $-\nabla^*\cdot A(\xi+\nabla\phi)=0$ such that $\phi(0)=0$, $\nabla\phi$ is stationary and $\langle\nabla\phi\rangle=0$, $\langle\cdot\rangle$ denoting the ensemble average (or expectation). It is known (``by ergodicity'') that the above ensemble average of the energy density $\mathcal {E}=(\xi+\nabla\phi)\cdot A(\xi+\nabla\phi)$, which is a stationary random field, can be recovered by a system average. We quantify this by proving that the variance of a spatial average of $\mathcal {E}$ on length scales $L$ satisfies the optimal estimate, that is, $\operatorname {var}[\sum \mathcal {E}\eta_L]\lesssim L^{-d}$, where the averaging function [i.e., $\sum\eta_L=1$, $\operatorname {supp}(\eta_L)\subset\{|x|\le L\}$] has to be smooth in the sense that $|\nabla\eta_L|\lesssim L^{-1-d}$. In two space dimensions (i.e., $d=2$), there is a logarithmic correction. This estimate is optimal since it shows that smooth averages of the energy density $\mathcal {E}$ decay in $L$ as if $\mathcal {E}$ would be independent from edge to edge (which it is not for $d>1$). This result is of practical significance, since it allows to estimate the dominant error when numerically computing $a_{\mathrm {hom}}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Antoine Gloria, Felix Otto. 2011-04-07. An optimal variance estimate in stochastic homogenization of discrete elliptic equations. https://doi.org/10.1214/10-aop571

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