Moderate Deviation for Random Elliptic PDEs with Small Noise
Xiaoou Li, Jingchen Liu, Jianfeng Lu, Xiang Zhou

TL;DR
This paper analyzes the probability of rare events in elliptic PDEs with small random noise, providing sharp asymptotic approximations for systems with low but non-negligible uncertainty.
Contribution
It introduces a novel asymptotic analysis framework for rare events in elliptic PDEs with diminishing noise levels, advancing understanding of low-noise stochastic systems.
Findings
Derived sharp asymptotic approximations for rare event probabilities
Characterized the impact of small noise on PDE solution uncertainty
Provided theoretical insights into low-noise elliptic PDE behavior
Abstract
Partial differential equations with random inputs have become popular models to characterize physical systems with uncertainty coming from, e.g., imprecise measurement and intrinsic randomness. In this paper, we perform asymptotic rare event analysis for such elliptic PDEs with random inputs. In particular, we consider the asymptotic regime that the noise level converges to zero suggesting that the system uncertainty is low, but does exists. We develop sharp approximations of the probability of a large class of rare events.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Stochastic processes and financial applications · Probability and Risk Models
Moderate Deviation for Random Elliptic PDEs with Small Noise
Xiaoou Li
School of Statistics, University of Minnesota, Minneapolis, MN 55455
,
Jingchen Liu
Department of Statistics, Columbia University, New York, NY 10027
,
Jianfeng Lu
Department of Mathematics, Department of Physics, and Department of Chemistry, Duke University, Durham, NC 27708 USA
and
Xiang Zhou
Department of Mathematics, City University of Hong Kong, Tat Chee Ave, Kowloon, Hong Kong SAR
Abstract.
Partial differential equations with random inputs have become popular models to characterize physical systems with uncertainty coming from, e.g., imprecise measurement and intrinsic randomness. In this paper, we perform asymptotic rare event analysis for such elliptic PDEs with random inputs. In particular, we consider the asymptotic regime that the noise level converges to zero suggesting that the system uncertainty is low, but does exists. We develop sharp approximations of the probability of a large class of rare events.
1. Introduction
The study of rare events due to system uncertainty, for example the failure of materials due to intrinsic randomness, is crucial and yet challenging. While those events do not often occur, they lead to catastrophic consequences. Therefore it is important to estimate the probabilities of such events and to characterize those events which help finding interventions to prevent them from happening. In this paper, we consider the following classical continuum mechanical model in the form of a linear elliptic partial differential equation (PDE) defined on a domain ,
[TABLE]
subject to certain boundary conditions that will be specified in the sequel. The solution to the above equation is the displacement field of the elastic material, is the strain, is the elasticity tensor, is the stress tensor, and is the external body force. The elasticity tensor (which is uniformly positive definite) is determined by the property of the specific material. Instead of assuming that is deterministic, we are interested in the situations when the tensor contains randomness. The randomness is introduced to incorporate the uncertainties of simple elastic materials at the macroscopic level or heterogeneity in the microstructures of complex materials. Under this setting, the solution (as a function of ) is also a stochastic process whose law is determined by that of .
Besides material mechanics, the elliptic PDE (1) arises also in many other fields of applications, such as hydrogeology and porous medium. The tensor carries different names such as conductivity and permeability. It is recognized that the modeling of the random field is of primal importance for the analysis. In this paper, we consider that the random function follows a log-normal distribution, that is,
[TABLE]
where is a Gaussian random field defined on and is a deterministic function. In elasticity, in general is a function of -tensor. For simplicity of notation, we consider a scalar field here (i.e., an isotropic material). The technique and result for a general is similar. The scalar is a parameter indexing the noise level. Many studies by practioners, e.g., [Freeze, 1975, Bear and Verruijt, 1987, Charbeneau, 2000], have shown that the best fit of the empirical data is the log-normal distribution. Hence, the log-normal assumption is well justified in applications and is used in mathematical analysis and numerical computation of the random PDE (1). In our paper, we follow this convention of log-normal assumption for the rare-event analysis.
In this work, we consider the small noise asymptotic regime, that tends to zero. Yet, even small noise can lead to drastic difference of the PDE solution from that of the deterministic case when the noise level is zero. Our results characterize such rare events, more precisely, the deviation of the solution of the random elliptic PDE in the presence of small noise. In particular, we focus on the deviation from the deterministic solution as the uncertainty level goes to [math]. Let be a mapping from to . Of primary interest
[TABLE]
where is the solution to equation (1) and is the solution when the noise level is zero, i.e., . The level will be sent to zero as the noise level goes to zero, which will be specified in the sequel. The main contribution of this paper is to derive sharp asymptotic approximations of as .
Given that is a (complicated) functional of the input Gaussian process , the analysis of the tail probability links naturally to the rare-event analysis of Gaussian random field. The study of the extremes of Gaussian random fields focuses mostly on the tail probabilities of the supremum of the field. The results contain general bounds on as well as sharp asymptotic approximations as . A partial literature contains [Landau and Shepp, 1970, Marcus and Shepp, 1970, Sudakov and Tsirelson, 1974, Borell, 1975, Borell, 2003, Ledoux and Talagrand, 1991, Talagrand, 1996, Berman, 1985]. Several methods have been introduced to obtain bounds and asymptotic approximations. A general upper bound for the tail of is developed in [Borell, 1975, Tsirelson et al., 1976], which is known as the Borel–TIS inequality. For asymptotic results, there are several methods, such as the double sum method ([Piterbarg, 1996]) , the Euler–Poincaré characteristics of the excursion set approximation ([Adler, 1981, Taylor et al., 2005, Adler and Taylor, 2007, Taylor and Adler, 2003]), the tube method ([Sun, 1993]), and the Rice method ([Azais and Wschebor, 2008, Azais and Wschebor, 2009]). Recently, the exact tail approximation of integrals of exponential functions of Gaussian random fields is developed by [Liu, 2012, Liu and Xu, 2012]. Efficient computations via importance sampling has been developed by [Adler et al., 2008, Adler et al., 2012]. For the analysis of the tail probabilities of lognormal random fields with small noise, refer to the recent work in [Li et al., 2016]. There are also existing work in the context of PDE with random coefficients. [Liu and Zhou, 2013, Liu and Zhou, 2014] derive asymptotic analysis of one-dimensional elliptic PDE. [Liu et al., 2015] presents the corresponding rare-event simulation algorithms. These works focused on the asymptotic regime that the noise level is fixed. Furthermore, [Xu et al., 2014] presents asymptotic analysis for stochastic KdV equation.
The rest of the paper is organized as follows. Section 2 presents the problem setup and the main asymptotic results. The technical proofs are given in Section 3.
2. Main results
2.1. The problem setup
We consider the following elliptic PDE. Let be an open domain with a smooth boundary. The differential equation concerning with Dirichlet boundary condition is given by
[TABLE]
In the context of elastic mechanics, characterizes the material deformation due to external force and gives the stiffness of the material. Throughout this paper, we assume to be a scalar function for simplicity. We assume that the material is clamped to a frame on the boundary and hence the Dirichlet boundary condition in (3) is assumed. The external force is sufficiently smooth and bounded, that is, there exists a constant such that
[TABLE]
We study the behavior of the material under the influence of internal randomness, which may be the result of manufacturing processing or the uncertainty of the material properties at the microscopic level. We adopt a probabilistic viewpoint of the complexity and heterogeneity inherent in the material and view the coefficient as a random field. The process is physically restricted to be positive and is modeled as a lognormal random field given as in (2). Furthermore, the Gaussian random function has mean zero and its covariance function is denoted by
[TABLE]
which is certainly independent of . In addition, admits the normalization condition .
The solution depends implicitly on through equation (3) and further via a logarithmic change of variable. It is useful to define a mapping from the coefficient to the solution
[TABLE]
where is the solution to equation (3) with . This mapping depends only on the deterministic function , the external force , the domain , and the boundary condition. In this paper, we are interested in the asymptotic regime that the amplitude of the uncertainty level tends to zero. Then the failure problem concerns the random solution u_{\sigma\xi}=\mbox{\mathbf{J}}(\sigma\xi) by noting the definition of above. As , the process tends to its limiting field . Let be the corresponding limiting solution satisfying equation
[TABLE]
Then, under mild conditions, we have as .
We provide asymptotic analysis of the event that deviates from its limiting solution . Let be a functional from to characterizing the deviation. For instance . Let be the composition of and , that is,
[TABLE]
To simplify notation, we always choose such that . We are interested the tail probability of as . In particular, we derive asymptotic approximations for
[TABLE]
where the deviation level is chosen to be for some fixed and . In particular, the deviation level also goes to [math] as the uncertainty vanishes.
2.2. Asymptotic results
We first introduce some notation that will be used in the sequel. Throughout this analysis, we consider to be a differentiable function and let be its Fréchet derivative, that is,
[TABLE]
For , we say that a function is Hölder continuous with order if the Hölder coefficient
[TABLE]
We use to denote the space containing all -time continuously differentiable functions. For nonnegative integer and , we use to denote the set of functions in whose -th order partial derivatives are Hölder continuous with coefficient . For simplicity, we write . We proceed to the definition of norms over . We first define the seminorms
[TABLE]
where is a multi-index , , and . We further define the norms
[TABLE]
Equipped with , the space is a Banach space for all non-negative integer and . To simplify notation, we write
[TABLE]
We now present sharp asymptotic approximations of the tail probabilities under the following assumptions on the functional and the covariance function .
Assumption**.**
- A1.
There exist constants such that is a non-negative integer, , and for all , . In addition is a (local) Lipschitz operator in the sense that for all , we have
[TABLE]
- A2.
There exists such that .
- A3.
The Gaussian random field has a Hölder continuous sample path and belongs to the space almost surely, that is, . The covariance function is positive definite and satisfies . Moreover, we assume that for all such that , where we define
[TABLE]
Define a mapping
[TABLE]
We consider the optimization problem
[TABLE]
where the functional is
[TABLE]
and the set is defined as
[TABLE]
for some and is given as below (7). Because is a compact subset of and the functionals and are continuous over , the above optimization problem has at least one solution. Later in the current section, we will show that this solution is also unique. With the above optimization, we have the following sharp asymptotic approximation for the tail probability of .
Theorem 1**.**
Under Assumptions A1-A3, for and , we have
[TABLE]
where and
[TABLE]
The constants and in Assumptions A1-A3 are problem-dependent. For example, [Li et al., 2015] consider the functional
[TABLE]
where is a deterministic function. This particular satisfies Assumptions A1 and A2 with and . In the context of elliptic PDE, the following theorem presents sufficient conditions for Assumptions A1-A3 with and .
Theorem 2**.**
Let the functional , where is the solution to (3). Suppose that the following assumptions hold.
- H1.
There exist constants such that , and for all . In addition, is Lipschitz in the sense that
[TABLE]
for all . Here, is the solution to (6) when is set to be .
- H2.
There exists such that , where is the solution to the PDE
[TABLE]
- H3.
* is a bounded domain with a boundary , , and .*
- H4.
The Gaussian random field is Hölder continuous and belongs to the space almost surely. Its covariance function is positive definite and satisfies . Moreover, we assume that for all such that , where is defined in (9).
Then Assumptions A1-A3 are satisfied with and the Hölder coefficient being .
Under Assumption H3, the PDE (3) has a unique solution when is set to be . Furthermore, under Assumptions H1 and H3, (12) also has a unique solution in . Therefore, and in the above theorem are well defined. See Lemma 5 on page 5 for the existence and the uniqueness of the Hölder continuous solution to elliptic PDEs. Combining Theorems 1 and 2, we arrive at the next corollary.
Corollary 1**.**
Under the assumptions of Theorem 2, for and , we have
[TABLE]
where and is the minimum obtained in (10).
2.3. Numerical approximation
Now we proceed to characterizing the solution to the optimization (10).
Theorem 3**.**
Under Assumptions A1-A3,
- (i)
the optimization problem (10) has a unique solution for sufficiently small, denoted by ;
- (ii)
we have the following approximation as
[TABLE]
where we write if as .
The solution of the optimization in (10) is generally not in a closed form. Theorem 3 presents its first order approximation. It is not accurate enough for a sharp asymptotic approximation. We present further a numerical approximation for in the following section.
In this section, we present a numerical method for computing the solution to (10). To solve theoptimization, we introduce the Lagrangian multiplier and define the Lagrangian function
[TABLE]
The first order condition implies the KKT condition for and
[TABLE]
Since the covariance function is positive definite and thus the linear map is a bijection. The above condition becomes
[TABLE]
The solution (, ) to the constrained optimization problem is determined by
[TABLE]
Our strategy is to first find given to satisfy the constraint (14b); and then we look for and the corresponding determined by the previous step to satisfy the fix point equation (14a). Motivated by this, we define a functional
[TABLE]
such that for each , solves the following equation
[TABLE]
To see that is well defined, for each we define the function ,
[TABLE]
Clearly, solutions to (15) are fixed points of the function . The well-posedness of the function is then established by the next proposition.
Proposition 1**.**
For sufficiently small, , and , we have that and there exists a constant independent of and , such that
[TABLE]
The above proposition and the contraction mapping theorem guarantee that for each , has a unique fixed point in . Therefore, there is a unique solution satisfying (15). Furthermore, it ensures the convergence of the iterative algorithm based on the contraction mapping . We further define an operator .
[TABLE]
Proposition 2**.**
For sufficiently small, is a contraction mapping over . More specifically, there exists a constant such that for all , we have
[TABLE]
The above proposition and the contraction mapping theorem guarantee that (14) has a unique solution in . Furthermore, this solution can be computed numerically via the following iterative algorithm.
Initialize 2. 2.
At -th iteration, update by
[TABLE]
According to the contraction mapping theorem, the rate of convergence is
[TABLE]
Therefore, if we run iterations, then , and we could use to approximate in Theorem 1.
3. Technical proofs
Throughout the proof we will use as generic notation for large and not-so-important constants whose value may vary from place to place. Similarly, we use as generic notation for small positive constants. Furthermore, for two sequences and , we write if as tend to zero and if is bounded when varies. Moreover, for two sequences of functions and , we write if and if .
The proofs in this sections are organized as follows. The proof of Theorem 1 is presented in Section 3.1. Section 3.2 shows the proof of Theorem 2. Section 3.3 presents proofs of Proposition 1, 2, and 3. The proofs of supporting lemmas are postponed to Appendix A.
3.1. Proof of Theorem 1
We start with a useful lemma that restrict our analysis on the event , whose proof will be presented in Section A.
Lemma 1**.**
There exists positive constant such that
[TABLE]
Proof for Theorem 1.
Let be the solution to (10). We define an exponential change of measure
[TABLE]
Under measure , is a Gaussian random field with mean function and covariance function . Let
[TABLE]
According to Lemma 1, we only need to consider the event restricted to . By means of the change of measure , we have
[TABLE]
where \mbox{\mathbf{E}}^{\mathbb{Q}} denotes the expectation with respect to the measure . It is easy to check that the random field under has the same distribution as under . Thus, we replace the probability measure and with and in (18) and obtain
[TABLE]
We define two events
[TABLE]
Let the event . We will present an approximation for
[TABLE]
and show that
[TABLE]
is ignorable, where denotes the symmetric difference between two sets. First, we compute
[TABLE]
According to Proposition 2, is the fixed point of the contraction map and thus
[TABLE]
Therefore, and are different only by a factor of . Thus, and are different by a factor . The following lemma establishes an approximation for .
Lemma 2**.**
For all , . This approximation is uniform in .
Thanks to Lemma 2, we have
[TABLE]
Let , then is a normally distributed random variable with a zero mean. The expectation (19) can be computed as follows
[TABLE]
where is a random variable following the exponential distribution with rate . Notice that
[TABLE]
The second equality is obtained with the aid of Proposition 3(ii). The above display, (20) and dominated convergence theorem give
[TABLE]
Now, we proceed to the term .
Lemma 3**.**
Under Assumption A1, we have that for ,
[TABLE]
where is the Lebesgue measure of and are constants appeared in Assumption A1.
According to Lemma 3, we have that for sufficiently small and ,
[TABLE]
Note that on the event , and have opposite signs and thus
[TABLE]
We combine (22) and (23) and arrive at
[TABLE]
We write , then the above display implies that
[TABLE]
This gives an upper bound of the expectation
[TABLE]
On the event , this expectation is negligible compared to , that is,
[TABLE]
The second equality in the above display is due to (21). Furthermore, on the set , we have , where is a sufficiently large constant. Therefore, we only need to focus on the expectation
[TABLE]
where is the density function of .
Lemma 4**.**
For , there exists a constant such that
[TABLE]
With the above lemma, the expectation (25) is bounded by
[TABLE]
for sufficiently small so that . The above inequality is further bounded by
[TABLE]
Therefore,
[TABLE]
We combine our analysis for and and conclude our proof for Theorem 1. ∎
3.2. Proof of Theorem 2
Proof of Theorem 2.
We first present two useful lemmas. The following lemma guarantees the existence and uniqueness of the Hölder continuous solution to the elliptic PDE.
Lemma 5**.**
Suppose that is a bounded domain with a boundary for . Assume that there exist positive constants and such that , and , and . Then the elliptic PDE
[TABLE]
has a unique solution in . Denote this solution by , then
[TABLE]
where is a positive constant, depending only on and the domain .
We will also need the following lemma on the stability of the solution.
Lemma 6**.**
Suppose that is a bounded domain with a boundary for . Let , , and be functions over the domain such that
[TABLE]
Then,
[TABLE]
where the constant depends only on and the domain .
The Fréchet derivative has the following expression.
[TABLE]
where , is the unique solution to
[TABLE]
and is the unique solution to
[TABLE]
For , we are going to establish an upper bound for . Note that
[TABLE]
Thus,
[TABLE]
We will establish upper bounds for the three terms on the right-hand side in the above expression separately. First, note that , . Thus, there exists a constant such that for all ,
[TABLE]
Therefore,
[TABLE]
Now we present upper bounds for and . Let be sufficiently small such that for all , and . According to Lemma 5, we have that for all
[TABLE]
where and . Furthermore, according to Assumption H1, we have that for
[TABLE]
Set in Lemma 5 we have
[TABLE]
Combine this with (31) and (32), we have that for
[TABLE]
with a possibly different . We proceed to the second term on the right-hand side of (29).
[TABLE]
For , we have . Moreover, is bounded above by a constant according to (34). Therefore,
[TABLE]
for a possibly different . Taking , , and in Lemma 6, we have
[TABLE]
[TABLE]
We proceed to the third term on the right-hand side of (29).
[TABLE]
According to the definition of and (38), we have that for ,
[TABLE]
Motivated by the definition of and , we take , , and in Lemma 6, then
[TABLE]
According to Assumption H1, for , we have
[TABLE]
(43), (30), (33) and (42) give
[TABLE]
The above inequality and (41) give
[TABLE]
We combine (29), (35), (39), and (44), and arrive at
[TABLE]
for sufficiently small, and a possibly different . Thus, Assumption A1 is satisfied with . According to the definition of , Assumption A2 is a dirrect application of Assumption H2. Assumption A3 is the same Assumption H4 for . Now we have already checked all the Assumptions A1-A3. ∎
3.3. Proof of propositions
Proof of Proposition 1 .
Note that as tends to zero, we have , and for all and . This allow us to expand near the origin. We elaborate this expansion as follows. First, according to Assumption A1, we have that there exists a constant such that for all and ,
[TABLE]
Second, with the aid of (46) we have that for all and ,
[TABLE]
Thanks to Lemma 3 on page 3 and (47), we have that for all and ,
[TABLE]
where we define
[TABLE]
Setting as in (46), we have
[TABLE]
The last equality in the above display is due to (46) and the fact . According to (47) and (49), we have
[TABLE]
Note that for the above expression is simplified as
[TABLE]
Combining the above expression with (48), we have that for and .
[TABLE]
which can be simplified as
[TABLE]
Recall the definition of , we plug the above expression into the difference , and arrive at
[TABLE]
which is simplified as
[TABLE]
The above expression implies that for ,
[TABLE]
This shows that is a contraction mapping for . To see for and , we let and in (52) and obtain that
[TABLE]
Recall that , and . This implies
[TABLE]
and concludes our proof. ∎
Proof of Proposition 2.
According to the definition of ,
[TABLE]
Therefore, we have
[TABLE]
We establish upper bound for the first and second terms on the right-hand-side of the above inequality separately. To start with, according to Assumptions A1 and A3 that , for , we have
[TABLE]
The second equality in the above expression is due to Lemma 2 on page 2. We proceed to the second term on the right-hand-side of (54). Because is the fixed point of , we have
[TABLE]
Taking differencing between the above two equalities, we have
[TABLE]
Adding and subtracting the term in the above equality, we have
[TABLE]
Consequently,
[TABLE]
According to Proposition 1, the first term on the right-hand-side of the above expression is bounded above by .
Lemma 7**.**
For all and , we have
[TABLE]
According to Lemma 7, the second term on the right-hand-side of (56) is bounded above by Therefore, we have
[TABLE]
Consequently, we have that for ,
[TABLE]
According to (46),
[TABLE]
The above approximation and (57) give
[TABLE]
Combining the above display with (54) and (55), we complete our proof. ∎
Proof of Proposition 3.
(i) is a direct application of Proposition 2, contraction mapping theorem and the KKT condition (14). We proceed to the proof of (ii). Because is the fixed point of in , we have
[TABLE]
To obtain the second equality in the above display, we use approximation in Lemma 2 on page 2 and (46). ∎
Acknowledgement
Jingchen Liu is partially supported by the National Science Foundation (SES-1323977, IIS-1633360) and Army Grant (W911NF-15-1-0159). Jianfeng Lu is partially supported by National Science Foundation (DMS-1454939). Xiang Zhou acknowledges the support from Hong Kong General Research Fund (109113, 11304314, 11304715).
Appendix A Proof of supporting lemmas
Proof of Lemma 1.
Note that the event \{\xi-\mbox{\mathbf{C}}\xi^{*}\notin\mathcal{B}\}=\{|\xi-\mbox{\mathbf{C}}\xi^{*}|_{k,\beta}>\sigma^{\alpha-1-\varepsilon}\} implies the event . According to Proposition 3, . Thus,
[TABLE]
for a positive constant and sufficiently small. Recall the definition
[TABLE]
Consequently,
[TABLE]
The equality in the above display is due to the fact that for any random variable , and constant . According to the above display, we arrive at a upper bound of probability.
[TABLE]
We establish upper bounds for and separately. We first analyze the term . We will need the following lemma, known as the Borell-TIS inequality, which was proved independently by [Borell, 1975] and [Cirel’son et al., 1976].
Lemma 8** (Borell-TIS inequality).**
Let be a centered and almost surely bounded Gaussian random field. Then, \mbox{\mathbf{E}}\sup_{x\in{U}}|g(x)|<\infty. Furthermore, for any t>\mbox{\mathbf{E}}\sup_{x\in{U}}|g(x)|, we have
[TABLE]
According to Lemma 8, we have that for all , \mbox{\mathbf{E}}\sup_{x\in\bar{U}}|D^{\gamma}\xi(x)|<\infty and
[TABLE]
for sufficiently small such that \sigma^{2\alpha-2-2\varepsilon}>2\mbox{\mathbf{E}}\sup_{x\in\bar{U}}|D^{\gamma}\xi(x)|, and is defined (9). According to Assumption A3, there exists a constant such that for all ,
[TABLE]
The above display together with (60) give
[TABLE]
Combine this with (59), we have
[TABLE]
for a possibly different such that . We proceed to establishing upper bounds for , . Recall that
[TABLE]
Motivated by this definition, we define another centered Gaussian random field double indexed by
[TABLE]
According to Assumption A3 almost surely. Thus, is bounded almost surely. According to Lemma 8, we have that \mbox{\mathbf{E}}{\sup_{x,y\in\bar{U},x\neq y}|g(x,y)|}<\infty, and
[TABLE]
for sufficiently small such that \sigma^{2\alpha-2-2\varepsilon}>2\mbox{\mathbf{E}}\sup_{x,y\in\bar{U}}|g(x,y)|. The variance of in the above expression is bounded above as follows.
[TABLE]
which is bounded above by a constant according to Assumption A3. Thus, we have
[TABLE]
Note that . Therefore, the above display is equivalent to
[TABLE]
We conclude our proof by combining the above inequality with (61). ∎
Proof of Lemma 2.
Because is a fixed point of , this lemma is a direct application of (53). ∎
Proof of Lemma 3.
We define a function ,
[TABLE]
Notice that and . Apply mean value theorem to , we have
[TABLE]
for some . According to the definition of Fréchet derivative, it is easy to check that
[TABLE]
Furthermore, we have
[TABLE]
Here, is the Lebesgue measure of the set , the second inequality is due to Assumption A1, and the third inequality is due to the fact that , . Combine the above inequality and (64) we obtain the desired result. ∎
Proof of Lemma 4.
We prove the lemma by induction. We first prove this lemma for the case where and . We consider the conditional random field . It can be shown that there exists a continuous Gaussian random field, denoted by , who has the same distribution as and belongs to almost surely. The mean and covariance function of satisfy
[TABLE]
According to the expression (21) and , we have that,
[TABLE]
Let be a centered Gaussian random field. Then event implies that . Furthermore, according to (65) and Lemma 2 on page 2, we have
[TABLE]
Because , we have for a possibly different . Therefore,
[TABLE]
Consequently, we have
[TABLE]
According to the definition of the norm Therefore, an upper bound for (66) is
[TABLE]
We will present upper bounds for the first and second terms in the above display separately. We start with the first term. Because is a centered and continuous Gaussian random field, with the aid of Lemma 8, we have that \mbox{\mathbf{E}}\sup_{x\in\bar{U}}|\zeta(x)|<\infty and
[TABLE]
for and such that \varepsilon_{0}\sigma^{\frac{\alpha}{2}-1}\sqrt{z}>2\mbox{\mathbf{E}}\sup_{x\in\bar{U}}|\zeta(x)|. Because , \varepsilon_{0}\sigma^{\frac{\alpha}{2}-1}\sqrt{z}>2\mbox{\mathbf{E}}\sup_{x\in\bar{U}}|\zeta(x)| is satisfied for sufficiently small. Consequently, for sufficiently small, we have
[TABLE]
for a sufficiently small and possibly different . We proceed to the second term on the right-hand-side of (67). Because almost surely, we obtain an upper bound for using similar arguments as those for (63) on page 63
[TABLE]
for sufficiently small and a positive constant . Combine (67), (68) and (69), we have
[TABLE]
Recall that has the same distribution as , thus (70) implies
[TABLE]
Using similar arguments, we have that for sufficiently small
[TABLE]
Combing the above inequality with (71), we have
[TABLE]
for and sufficiently small. This completes our proof for the case where and . For the case and , . With similar proof as those for (68), we have
[TABLE]
We also have similar results conditional on . Therefore, for we also have
[TABLE]
This completes our proof for the case that . We now proceed to prove the lemma for . Assuming that for ,
[TABLE]
for some positive constant that is independent with and but possibly depend on . We will prove that the following inequality holds for sufficiently small and a positive constant ,
[TABLE]
According to the definition of the norm , we know that for
[TABLE]
Therefore,
[TABLE]
Consequently, we arrive at an upper bound
[TABLE]
We present upper bounds for the first and second terms on the right-hand-side of the above display separately. For the first term, according to (74), we have
[TABLE]
For the second term, notice that
[TABLE]
Therefore,
[TABLE]
Now we present upper bounds for the two terms on the right-hand-side of the above inequality for and such that and . To do so, we consider a continuous Gaussian random field that belongs to almost surely, and it has the same distribution as .
Lemma 9**.**
Let C_{\chi_{1}}(s,t)=\mbox{\mathbf{E}}\chi_{1}(s)\chi_{1}(t) and \mu_{\chi_{1}}(t)=\mbox{\mathbf{E}}\chi_{1}(t), then we have
[TABLE]
The above expressions are uniform in for .
Notice that the above lemma has the same form as (65), so with similar arguments as those for (68), we have
[TABLE]
Also, similar as arguments before (69), we have
[TABLE]
Combining (79) and (80) and (78), we have
[TABLE]
Combining the above display with (76) and (77), we have
[TABLE]
for sufficiently small and a possibly different constant . Similarly, conditional on , we have
[TABLE]
Thus,
[TABLE]
and we complete the proof for (75) for the case where . For , . We obtain the proof for the case where by ignoring all the terms in the proof for the case where . This completes the induction. ∎
Proof of Lemma 5.
According to Theorem 6.14 in [Gilbarg and Trudinger, 2015], we have that the PDE (27) has a unique solution in . Denote this solution by , then according to Theorem 6.6 in [Gilbarg and Trudinger, 2015], we have the upper bound
[TABLE]
We conclude the proof with the following upper bound provided by Theorem 3.7 in
[Gilbarg and Trudinger, 2015],
[TABLE]
for a constant depending only on the domain and . ∎
Proof of Lemma 6.
According to the definition of and , we have that
[TABLE]
Taking difference between the above two equalities, we have
[TABLE]
Rearranging terms in the above expression, we have
[TABLE]
Therefore, is a solution to the elliptic PDE
[TABLE]
where . According to Lemma 5, we have
[TABLE]
We further establish an upper bound for ,
[TABLE]
According to Lemma 5,
[TABLE]
Combining this with (81) and (82), we have
[TABLE]
We complete the proof by setting . ∎
Proof of Lemma 7.
We take difference between and ,
[TABLE]
Therefore,
[TABLE]
According to Lemma 3, we have
[TABLE]
According to (46) and Assumption A1, the above display can be further simplified as
[TABLE]
which is further simplified as
[TABLE]
The above expression and (83) give
[TABLE]
The last inequality in the above expression is due to . ∎
Proof of Lemma 9.
We need the next lemma for the current proof.
Lemma 10**.**
We define the covariance function
[TABLE]
Then for all under Assumption A3.
Now we compute the mean and covariance of .
[TABLE]
and
[TABLE]
Recall that for some positive constant , and . With the aid of Lemma 10, we simplify the mean and covariance of .
[TABLE]
and
[TABLE]
∎
Proof of Lemma 10.
We will use induction to prove that for all , ,
[TABLE]
To start with, for and , (84) holds because of Assumption A3 and
[TABLE]
Suppose that for all ,
[TABLE]
For , we want to show that
[TABLE]
Without loss of generality, we assume that and . Let be a -dimensional basis vector, and , then . We compute .
[TABLE]
Consequently,
[TABLE]
Thus,
[TABLE]
The second inequality of the above display is due to (85). The lemma is proved by induction. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Adler, 1981] Adler, R. (1981). The Geometry of Random Fields . Wiley, Chichester, U.K.; New York, U.S.A.
- 2[Adler et al., 2008] Adler, R., Blanchet, J., and Liu, J. (2008). Efficient simulation for tail probabilities of Gaussian random fields. In Proceeding of Winter Simulation Conference .
- 3[Adler et al., 2012] Adler, R., Blanchet, J., and Liu, J. (2012). Efficient Monte Carlo for large excursions of Gaussian random fields. Ann. Appl. Probab. , 22(3):1167–1214.
- 4[Adler and Taylor, 2007] Adler, R. and Taylor, J. (2007). Random fields and geometry . Springer.
- 5[Azais and Wschebor, 2008] Azais, J. M. and Wschebor, M. (2008). A general expression for the distribution of the maximum of a Gaussian field and the approximation of the tail. Stochastic Processes and their Applications , 118(7):1190–1218.
- 6[Azais and Wschebor, 2009] Azais, J. M. and Wschebor, M. (2009). Level sets and extrema of random processes and fields . Wiley, Hoboken, N.J.
- 7[Bear and Verruijt, 1987] Bear, J. and Verruijt, A. (1987). Modeling Groundwater Flow and Pollution . D. Reidel Publishing Company, Holland.
- 8[Berman, 1985] Berman, S. M. (1985). An asymptotic formula for the distribution of the maximum of a Gaussian process with stationary increments. Journal of Applied Probability , 22(2):454–460.
