This paper investigates the joint limiting distributions of maxima and minima of centered homogeneous Gaussian random fields over continuous time and various grids, revealing dependence structures based on the field's dependence strength.
Contribution
It provides new theoretical results on the asymptotic dependence or independence of maxima and minima for different types of Gaussian fields and grid configurations.
Findings
01
Maxima and minima are asymptotically dependent for strongly dependent fields with sparse, Pickands', or dense grids.
02
Maxima and minima are asymptotically independent for weakly dependent fields.
03
The results extend understanding of extremal behavior in Gaussian random fields.
Abstract
In this paper, for centered homogeneous Gaussian random fields the joint limiting distributions of normalized maxima and minima over continuous time and uniform grids are investigated. It is shown that maxima and minima are asymptotic dependent for strongly dependent homogeneous Gaussian random field with the choice of sparse grid, Pickands' grid or dense grid, while for the weakly dependent Gaussian random field maxima and minima are asymptotically independent.
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
TopicsFinancial Risk and Volatility Modeling · Stochastic processes and statistical mechanics · Geometry and complex manifolds
Full text
Maxima and minima of homogeneous Gaussian random fields over continuous time and uniform grids
Yingyin Lu Zuoxiang Peng
School of Mathematics and Statistics, Southwest University, Chongqing, 400715, China
Corresponding author. Email: [email protected]
Abstract. In this paper, for centered homogeneous Gaussian random fields the joint limiting distributions of normalized maxima and minima over continuous time and uniform grids are investigated. It is shown that maxima and minima are asymptotic dependent for strongly dependent homogeneous Gaussian random field with the choice of sparse grid, Pickands’ grid or dense grid, while for the weakly dependent Gaussian random field maxima and minima are asymptotically independent.
Keywords. Maximum and minimum; joint limit distribution; continuous time; uniform grid; homogeneous Gaussian random field.
Let {X(t),t≥0} be a stationary Gaussian process with mean zero, variance one and the correlation function r(t) which satisfies for some α∈(0,2],
[TABLE]
Assume that
[TABLE]
Under conditions (1.1) and (1.2), the limit distribution theory on the maximum of {X(t),t≥0} up to time T,
[TABLE]
is well developed that
[TABLE]
as T→∞, where Λ(x)=exp(−e−x) is the standard Gumbel distribution and
[TABLE]
Here Hα is the well-known Pickands’ constant, which is defined by Hα=limλ→∞Hα(λ)/λ with
[TABLE]
and BH is a fractional Brownian motion with EBH2(t)=∣t∣2H. It is well known that 0<Hα<∞, see e.g. Leadbetter et al. (1983), Pickands (1969) and Piterbarg (1996). The limit distribution theorem about MT extended by Mittal and Ylvisaker (1975) and McCormick and Qi (2000), and Dȩbicki et al. (2013) extended the results to homogeneous Gaussian random fields.
It is known that extreme value theory of Gaussian random fields may be applied to image analysis, quantum chaos, queuing theory, insurance mathematics, number theory and so on; see e.g. Adler (2000), Adler et al. (2014), and Hashorva and Ji (2016). Further, numerical simulation of trajectories of high extremes of continuous random processes may be performed through the discrete time random processes depending heavily on the sampling frequency, see, for instance Leadbetter et al. (1983), Piterbarg (2004) and recent work of Song et al. (2018, 2019) on flaw detection by using ultrasonic response signals.
The joint limiting distributions of MT and its discrete time maximum MTδ=max{X(t),t∈[0,T]∩ℜ(δ)} was first studied by Piterbarg (2004) under the conditions (1.1) and (1.2), where the uniform grid is given by ℜ=ℜ(δ)={kδ,k=0,1,2…} with δ(2logT)1/α→D∈[0,∞] as T→∞. For more details, see Piterbarg (2004). The results on multivariate stationary Gaussian processes can be found in Tan and Hashorva (2014, 2015), Tan and Wang (2013) and Tan and Tang (2014) for strongly dependent Gaussian processes. Further, Turkman (2012) considered the non-Gaussian processes and Chen and Tan (2016) studied the asymptotic behavior of MT, MTδ and the partial sum of dependent Gaussian processes.
For the joint asymptotic behaviors of MT and MTδ of homogeneous Gaussian random field, Tan and Wang (2015) considered the following model. Let {X(t),t≥0} be a homogeneous Gaussian field with mean zero, variance one and covariance function r(t)=Cov(X(t),X(0)) satisfies the following conditions, for d≥2:
A1:r(t)=1−∑i=1d∣ti∣αi(1+o(1)), as ti→0, with αi∈(0,2] ;
A2:r(t)<1, for t=0 ;
A3:limT→∞r(T)log(∏i=1dTi)=r∈[0,∞), where T→∞ means Ti→∞,i=1,2,⋯,d. If Ti=0, r(T1,⋯,Ti−1,0,Ti+1,⋯,Td)log(∏j=idTj) is bounded.
Define
[TABLE]
where IT=∏i=1d[0,Ti], and IT⋂∏i=1dℜ(δi) means ∏i=1d{[0,Ti]⋂ℜ(δi)}, and the uniform grid
ℜ(δi)={kδi,k∈N} is given by
[TABLE]
We say that the grid is dense if all Di=0 and if all Di=∞, the grid is sparse. The grid is called a Pickands grid if all Di∈(0,∞). Under conditions A1−A3, Tan and Wang (2015) derived the limiting distribution of MT when the uniform grid is sparse grid, Pickands’ grid and dense grid, respectively.
In this paper, our focus is on the joint limit distributions of maxima and minima of aforementioned homogeneous Gaussian random fields. Davis (1979) established the joint limiting distribution of maxima and minima of weakly dependent stationary sequences, and weakly dependent stationary Gaussian processes was studied by Berman (1971). For the asymptotic distributions of maxima and minima on bivariate Hüsler-Reiss models, see Liao and Peng (2015) and Lu and Peng (2017).
Similarly to the definition of maxima MT, define the minima mT as follows:
[TABLE]
and let
[TABLE]
where aT=2log(∏i=1dTi) and Hai,αi=limλi→∞λiHai,αi(λi)∈(0,∞)
with
[TABLE]
where Bα1/2(1)(⋅),⋯,Bαd/2(d)(⋅) are independent fractional Brownian motions, cf. Piterbarg (2004) and Tan and Wang (2015). Further, let the bivariate normalizing constants uT and vT be given by
[TABLE]
where bT∗=bTδ for sparse grids, bT∗=ba,T for Pickands grids and bT∗=bT for dense grids.
Throughout this paper, let ϕ(x) and Φ(x) denote respectively the density function and distribution function of a standard normal random variable, and Ψ(x)=1−Φ(x), and operations of vectors mean componentwise operating. For example, for vectors t=(t1,t2,⋯,td) and s=(s1,s2,⋯,sd), operations of s≤t, s−t, st, and st mean si≤ti,i=1,2,⋯,d, (s1−t1,s2−t2,⋯,sd−td), (s1t1,s2t2,⋯,sdtd) , and (s1t1,s2t2,⋯,sdtd), respectively. Let C be positive constant with values varying from place to place.
The contents of this paper are organized as follows. Section 2 presents the main results and Section 3 gives some auxiliary lemmas. The proofs of the main results will be given in Section 4.
2 Main results
Theorem 2.1**.**
Let X(t) be a centered homogenous Gaussian field with unit variance and covariance function r(t) satisfying A1−A3. Then for any sparse grids ℜ(δi), i=1,2,⋯,d,
Let X(t) be a centered homogenous Gaussian field with unit variance and covariance function r(t) satisfying A1−A3 and uT, vT be given by (1.4). Then for any Pickands grids ℜ(ai(2log∏i=1dTi)−1/αi) with ai>0, i=1,2,⋯,d, the following limit exists,
[TABLE]
and
[TABLE]
Theorem 2.3**.**
Let X(t) be a centered homogenous Gaussian field with unit variance and covariance function r(t) satisfying A1−A3. Then for any dense grids ℜ(δi), i=1,2,⋯,d, we have
Similar to the weakly dependent stationary Gaussian sequences and processes, for homogeneous Gaussian random fields, Theorems 2.1-2.3 shows that MT and mT are asymptotically independent if r=0.
3 Auxiliary results
For simplicity, let u=aT=2log(∏i=1dTi), so for i=1,2,⋯,d, if δiu2/αi→0, the grid is dense; if δiu2/αi→∞ , the grid is sparse, and δiu2/αi→Di∈(0,∞) for the Pickands grid.
For the sparse grids, let δi=δi(u)=li(u)u−2/αi,i=1,2,⋯,d, where li(u)→∞ as u→∞ with δi(u)≤δ0 for some δ0>0. Denote I(δ)=∏i=1d[−δi,δi] and
[TABLE]
where v2=(∑i=1d2/αi)logu+log(∏i=1dδi). The following Lemmas 3.1-3.3 extended Lemmas 1, 2 and 4 of Piterbarg (2004) from stationary Gaussian processes to homogenous Gaussian random fields.
Lemma 3.1**.**
Suppose ℜ(δi), i=1,2,⋯,d are all sparse grids and the conditions A1−A2 hold, then P(u,x) given by (3.1) satisfies P(u,x)=o(Ψ(u)) as u→∞.
Proof. The proof is similar to Lemma 1 of Piterbarg (2004) and Lemma A1 of Tan and Wang (2015).
∎
Now, define
[TABLE]
and for small ϵ>0
[TABLE]
Lemma 3.2**.**
Suppose ℜ(δi), i=1,2,⋯,d, are all sparse grids and the conditions A1−A2 hold. Let Si=Si(u)≥2δi, i=1,2,⋯,d, for all u, and ∏i=1dSiuαi2=o(exp(u2δ(ϵ))) as u→∞. Then there exists an ϵ>0 such that
[TABLE]
[TABLE]
as u→∞ and
[TABLE]
as u→∞, so that
[TABLE]
as u→∞.
Proof. The proof is similar to Lemma 2 of Piterbarg (2004) and Lemma A2 of Tan and Wang (2015).
∎
In the following Lemma, we can prove that the maxima asymptotically coincide when the grids all are dense.
Lemma 3.3**.**
Let Si=Si(u) with (∏i=1dSiu−2/αi)→∞ and ∏i=1dSi=O(exp(κu2)) with κ∈(0,1/2) as u→∞. For any dense grids ℜ(δi)={aiku−2/αi,k∈N}, i=1,2,⋯,d , we have
[TABLE]
where ρa→0 as a→0.
Proof. This lemma follows from the Lemma D.1 and Lemma 15.3 of Piterbarg (1996), we can also find the detailed proof in the Lemma 12.3.2 of Leadbetter (1983).
∎
Following Tan and Wang (2015), define ρ(T)=r/log(∏i=1dTi) and let 1>a>b>0 be constants. Dividing [0,Ti] into intervals with length Tia alternating with shorter intervals with length Tib, i=1,2,⋯,d. Then the number of the long intervals is at most ni=⌊Ti/(Tia+Tib)⌋. Here ⌊⋅⌋ represents the integer part of the real number. Denote Oi=∏j=1d[(ij−1)(Tja+Tjb),(ij−1)(Tja+Tjb)+Tja], Ei=∏j=1d[(ij−1)(Tja+Tjb),ij(Tja+Tjb)], i=1,⋯,n and O=⋃iOi. Let {Xi(t),t≥0}, i≥1 be independent copies of {X(t),t≥0} and {η(t),t≥0} be such that η(t)=Xi(t) for t∈Ei.
Define
[TABLE]
where U is a standard normal variable independent of {η(t),t≥0}. Then ϱ(s,t), covariance function of {ξT(t),t∈IT}, is
[TABLE]
Let
[TABLE]
[TABLE]
Lemma 3.4**.**
Suppose ℜ(δi),i=1,2,⋯,d are all sparse grids or all Pickands grids. Then for the uT, vT given by (1.4) we have
[TABLE]
as T→∞.
Proof. Note that the homogeneous Gaussian fields {X(t),t≥0} and {−X(t),t≥0} have the same distribution so that
[TABLE]
By arguments similar to Lemma 3.1 of Tan and Wang (2015) (denote by mes(⋅) the Lebesgue measure), we have
[TABLE]
as T→∞. Combining (3.4), we can get the assertion of this lemma.∎
Lemma 3.5**.**
Denote the grids ℜ(qi) with qi=γiu−αi2, γi>0 and i=1,2,⋯,d. Assume that ℜ(δi),i=1,2,⋯,d, are all sparse grids or all Pickands grids. Then for uT and vT given by (1.4) we have
[TABLE]
as T→∞ and γ=(γ1,γ2,⋯,γd)→0.
Proof. It follows from Lemma 3.3 and the fact {X(t),t≥0}=d{−X(t),t≥0} that the left hand side of (3.5) can be bounded by
[TABLE]
as T→∞ and γ=(γ1,γ2,⋯,γd)→0. The result follows.
∎
Lemma 3.6**.**
Suppose ℜ(δi),i=1,2,⋯,d are all sparse grids or all Pickands grids, then for uT and vT given by (1.4) we have
[TABLE]
as T→∞.
Proof. It follows from the Normal Comparison Lemma (see e.g. Leadbetter et al. (1983) and Li and Shao (2002)) that the left hand side of (3.6) can be bounded by
[TABLE]
where rh(x,y)=hr(x,y)+(1−h)ϱ(x,y) with h∈[0,1].
Next we will show that F1→0, F2→0 and F3→0 as T→∞, respectively. For F1, we first consider the case that kq, lq in the same interval firstly, and split F1 into the following two parts:
[TABLE]
Following condition A1, we can choose small enough ϵ>0 such that max{∣ljqj−kjqj∣,j=1,2,⋯,d}≤ϵ and for all ∣ti∣≤ϵ<2−1/αi,
[TABLE]
then, by definition of ξT(t), we have ϱ(kq,lq)−r(kq,lq)=ρ(T)(1−r(kq,lq)) and ϱ(kq,lq)∼r(kq,lq) for sufficiently large T. With vT and uT given by (1.4) we have
[TABLE]
Hence,
[TABLE]
as u→∞.
Let
ϖ(t,s)=max{∣r(t,s)∣,∣ϱ(t,s)∣} and
[TABLE]
For JT,2, by the fact that uT2(x2)∼2log∏i=1dTi=u2 we have
[TABLE]
as u→∞ since a<1+θ(ϵ)1−θ(ϵ). Combining with (3.17), (3) and (3.26), we show that F1→0 for the first case that kq, lq in the same interval.
Second, we consider the case that kq∈Oi, lq∈Oj, i=j. Note that the distance between the points in any two rectangles Oi and Oj are larger than min{Tib,i=1,2,⋯,d} and ϱ(kq,lq)=ρ(T) for kq∈Oi, lq∈Oj, i=j. Then, F1 can be bounded by
[TABLE]
Split (3.33) into two parts, the first for min{∣kjqj−ljqj∣,j=1,2,⋯,d}>0, the second for min{∣kjqj−ljqj∣,j=1,2,⋯,d}=0 and denote them ST,1, ST,2, respectively. Let β be such that 0<b<a<β<1+θ(ϵ)1−θ(ϵ) for all sufficiently large T.
For ST,1, we can also divide it into the following two parts:
[TABLE]
then, by the same arguments as used in (3.26), we have
[TABLE]
as u→∞ since β<1+θ(ϵ)1−θ(ϵ).
To deal with ST,12, we can define
w1(t)=max{∣r(t)∣,∣ρ(T)∣} and
[TABLE]
Denote Tβ=(T1β,T1β,⋯,Tdβ) and by the condition A3, we have θ1(Tβ)≤Cu−2 for sufficiently large T and ∏j=1dkjqj>∏i=1dTiβ=eβu2/2, then, using (3.19), we have
[TABLE]
as u→∞. Therefore, we have
[TABLE]
Note that
[TABLE]
as u→∞. Combining condition A3, and (3.38)-(3), we can get ST,1→0 as T→∞.
Now, for ST,2, we only prove the case that k1q1=l1q1, and min{∣kjqj−ljqj∣,j=2,⋯,d}>0. Other cases can be proved by the similar arguments. If ∏i=2dTi≤∏i=1dTiβ=eβu2/2, where β<1+θ(ϵ)1−θ(ϵ), by the same arguments as used in (3) that
[TABLE]
as u→∞. If ∏i=2dTi>∏i=1dTiβ=eβu2/2, split ST,2 as follows:
[TABLE]
For ST,21, similar to the arguments as used in (3), we have
[TABLE]
as u→∞. To deal with ST,22, let
w2(t)=max{∣r(0,t2,⋯,td)∣,∣ρ(T)∣}
and
[TABLE]
By condition A3, we have θ2(Tβ)≤Cu−2 for sufficiently large T and ∏j=2dkjqj>∏i=1dTiβ=eβu2/2, then, by the same arguments as used in (3.38),
[TABLE]
thus we have
[TABLE]
which implies ST,22→0 as T→∞. Therefore, we showed that ST,2→0 as T→∞. Combining with ST,1→0, we showed that F1→0 as T→∞ for the second case.
Arguments similar to the proof of F1→0, we can show that F2→0 as T→∞. Details are omitted here. The reminder is to show that F3→0.
If kq, lδ in the same interval Oi, split F3 into two parts as
[TABLE]
Following condition A1, we can choose small enough ϵ>0 so (3.18) is satisfied and max{∣ljδj−kjqj∣,j=1,2,⋯,d}≤ϵ. By definition of ξT(t), we have ϱ(kq,lδ)=r(kq,lδ)+ρ(T)(1−r(kq,lδ))∼r(kq,lδ) for sufficient large T. If ℜ(δi),i=1,2,⋯,d are all Pickands grids, by the arguments similar to the proof of F1, we can show F3→0. If ℜ(δi),i=1,2,⋯,d are all sparse grids, it follows from (1.4) that
[TABLE]
Similarly for 21(vT2(x1)+(vTδ(y1))2), 21(uT2(x2)+(vTδ(y1))2) and 21(vT2(x1)+(uTδ(y2))2). In view of (3.18), we have
[TABLE]
Recall that qi=γiu−2/αi, and ℜ(δi), i=1,2,⋯,d are sparse grids, then after some calculation, (3.68) can be bounded by
[TABLE]
as u→∞.
Noting that uT∼(2log∏i=1dTi)1/2=u, we have
[TABLE]
as u→∞.
Next, we consider the case that kq∈Oi, lδ∈Oj, i=j. Note that the distance between the points in any two rectangles Oi and Oj is larger than min{Tib,i=1,2,⋯,d} and ϱ(kq,lδ)=ρ(T). Then, F3 is at most
[TABLE]
Split (3.85) into two parts, the first for min{∣kjqj−ljδj∣,j=1,2,⋯,d}>0, and the second for min{∣kjqj−ljδj∣,j=1,2,⋯,d}=0 and denote them as HT,1, HT,2, respectively. Then,
For HT,12, by the same arguments as used in (3.38), we have
[TABLE]
as u→∞. Then,
[TABLE]
By condition A3, the first term on the right hand side of (3.92) tends to [math] as T→∞, and the second term also tends to [math] by the same arguments of (3), then HT,12→0 as T→∞. Combining (3), we can get that HT,1→0 as T→∞.
Now, we consider HT,2, we only prove the case that k1q1=l1δ1, and min{∣kjqj−ljδj∣,j=2,⋯,d}>0. By the similar way, the rest cases can be proved. If ∏i=2dTi≤∏i=1dTiβ=eβu2/2, by the same arguments as used in (3) that
For HT,22, by the same arguments as used in (3.38), we have
[TABLE]
hence,
[TABLE]
which implies HT,22→0 as T→∞. Furthermore, HT,2→0, as T→∞. Combining (3.75), (3.78), (3) and (3.92), we can get F3→0 as T→∞. The proof is complete.
∎
Lemma 3.7**.**
Suppose ℜ(δi),i=1,2,⋯,d are all sparse grids or all Pickands grids and uT, vT are given by (1.4). Then for the grids ℜ(qi) with qi=γiu−2/αi and γi>0, i=1,2,⋯,d, we have
[TABLE]
as T→∞ and all γi↓0, where
[TABLE]
Proof. By the definition of {ξT(t),t≥0} and {η(t),t≥0}, we have
[TABLE]
By Lemma 3.3 and the dominated convergence theorem, we have
[TABLE]
as T→∞ and all γi↓0. Combining (3.109), we finish the proof.
∎
Lemma 3.8**.**
Let X(t) be a centered homogeneous Gaussian field with unit variance and covariance function r(t) satisfying A1−A3. Then for any sparse grids,
as T→∞. Then, combining (3.110)-(3.115) and Lemmas 3.4-3.7, the assertion of this lemma follows.
Lemma 3.9**.**
Let X(t) be a centered homogeneous Gaussian field with unit variance and covariance function r(t) satisfying A1−A3 and the uT, vT be given by (1.4). Then for Ha,αx,y given in Theorem 2.2 and any Pickands grids ℜ(ai(2log∏i=1dTi)−1/αi) with ai>0, i=1,2,⋯,d, we have
[TABLE]
Proof. Suppose ℜ(δi) are all Pickands grids and Si satisfies the conditions in Lemma 3.3. Denote
[TABLE]
then by using Lemma 6.1 of Piterbarg (1996), we have
where Zx2,y2=log(∏i=1dHαi)−log(∏i=1dHai,αi)+x2−y2. By the definition of Ha,αx,y, we get Ha,α0,Zx2,y2(∏i=1dHai,αi)−1e−y2=Ha,αx2+log(∏i=1dHαi),y2+log(∏i=1dHai,αi).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Adler, R. J. (2000). On excursion sets, tube formulas and maxima of random fields. The Annals of Applied Probability , 10(1) , 1-74.
2[2] Adler, R. J. , Moldavskaya, E. , and Samorodnitsky, G. (2014). On the existence of paths between points in high level excursion sets of gaussian random fields. The Annals of Probability , 42(3) , 1020-1053.
3[3] Berman, S. M. (1971). Asymptotic independence of the numbers of high and low level crossings of stationary gaussian processes. Annals of Mathematical Statistics , 42(3) , 927-945.
4[4] Berman, S. M. (1974). Sojourns and extremes of gaussian processes. Annals of Probability , 2(6) , 999-1026.
5[5] Chen, Y. and Tan, Z. (2016). Maxima and sum for discrete and continuous time Gaussian processes. Front Math China , 11(1) , 27-46.
6[6] Davis, R. A. (1979). Maxima and minima of stationary sequences. Annals of Probability , 7(3) , 453-460.
7[7] Dȩbicki, K., Hashorva, E. and Soja-Kukiela. (2013). Extremes of homogeneous gaussian random fields. Journal of Applied Probability , 52(1) , 55-67.
8[8] Hashorva, E. and Ji, L. (2016). Extremes of α ( t ) 𝛼 𝑡 \alpha(t) -locally stationary Gaussian random fields. Transactions of the American Mathematical Society , 368(1) , 1-26.