Convergence rate of extremes of normal triangular arrays

Xinling LIU , Shouquan CHEN

Front. Math. China ›› 2025, Vol. 20 ›› Issue (2) : 77 -89.

PDF (1798KB)
Front. Math. China ›› 2025, Vol. 20 ›› Issue (2) : 77 -89. DOI: 10.3868/s140-DDD-025-0007-x
RESEARCH ARTICLE

Convergence rate of extremes of normal triangular arrays

Author information +
History +
PDF (1798KB)

Abstract

In this paper, we mainly discuss the convergence rate of the limit distribution of a class of normal stationary triangular arrays, and point out that the convergence rate of this triangular array is not faster than that of the extremes of random variables in the i.i.d. case.

Graphical abstract

Keywords

Stationary normal sequence / extreme index / convergence rate

Cite this article

Download citation ▾
Xinling LIU, Shouquan CHEN. Convergence rate of extremes of normal triangular arrays. Front. Math. China, 2025, 20(2): 77-89 DOI:10.3868/s140-DDD-025-0007-x

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

There have been numerous studies on the asymptotic limit distribution of the maximum of a sequence of random variables. Assume that the first sequence of random variables {ξn,n0} is a stationary standard normal sequence with correlation coefficient ρj=Cov(ξ0,ξj), and the second sequence of random variables is an independent standard normal sequence. [1] proved that when

ρjlnj0,j

is satisfied, the limit distribution of the maximum of the first sequence max1inξi is the same as that of the maximum of the second sequence (Refer to [6]). [8] proved that condition (1.1) is indispensable to obtain the above conclusion. However, the conclusion in [1] does not consider the clustering case. [10] proved that for any sequence vn satisfying the convergence of n(1Φ(vn)) to a certain constant (Φ(x) represents a distribution function with standard normal distribution), the convergence rate of

supuvn|P(max1inξiu)Φn(u)|

is n1ρ1+ρ, where ρ=max{0,ρ1,ρ2,}.

To avoid the clustering situation, we take a standard normal triangular array {ξni, i=1,2,,n;n=1, 2,}into account, and for any fixed n, {ξni,i1} is a stationary standard normal sequence. Inspired by [3, 4] on the limit distribution of two-dimensional triangular arrays, a new condition was introduced in [5], that is, when n,

(1ρn,j)lnnδj(0,],j1,

where ρn,j=E(ξni,ξn,i+j),δ0=0, and the following conclusion was drawn:

Proposition 1.1  For the standard normal triangular array mentioned above, if condition (1.2) holds, there will exist two sequences of positive integers rn,ln satisfying when n,

lnrn0,rnn0,

and

limnn2rnj=lnn|ρn,j|(1ρn,j)12exp(2lnnlnlnn1+ρn,j)=0,

and

limmlimsupnj=mrnn1ρn,j1+ρn,jlnnρn,j1+ρn,j(1ρn,j2)12=0.

Then

limnP(max1inξniun(x))=exp(ϑex),

where un(x)=xan+bn. Normalizing constants an and bn are defined as follows:

an=(2lnn)12,bn=(2lnn)1212(2lnn)12(lnlnn+ln4π),

and

ϑ=P(E2+δkWkδk,k1andδk<).

If for all k1, it satisfies δk=, then ϑ=1, where E represents a standard exponential distribution independent of Wk, and {Wk:δk<,k1}is a joint normal distribution with mean zero. There is

E(WiWj)=δi+δjδ|ij|2(δiδj)12.

There have been numerous studies on the convergence rate of sequences of random variables. Recent researches include: [7] presents the convergence rate of the skewed normal distribution; [2] shows the convergence rate of the asymmetric normal distribution, and the like. In this paper, we will give the convergence rate where the triangular array in Proposition 1.1 converges to its limit distribution.

The structure of this paper is as follows: Section 2 introduces the main conclusions; Sections 3 and 4 present their proofs.

2 Main conclusions

Let {ξn} be a sequence of random variables. If for the subsets I = {i1,i2,,ip} and J={j1,j2,,jp'} of the set {1,2,,n}, miniJimaxiIiln, then un is a sequence of real numbers. We say

αn,ln=max{|P(ξiun,iIJ)P(Xiun,iI)P(Xiun,iJ)|}

is a mixing coefficient. If for a certain sequence ln=o(n) satisfying αn,ln0 (n ), we say {ξn} satisfies the Δ(un) condition.

Theorem 2.1  For the triangular array in Proposition 1.1, denote Mn=max1inξni, and under the assumption of Proposition 1.1, there exists a constant C, such that

supxR|P(Mnun)exp(ϑex)|(lnrn+nαn,lnrn+(lnlnn)2lnn+ρ(n))C,

where ρ(n)=Supδk<|(1ρn,k)lnnδk|.

Note 2.1 From Theorem 2.1, it can be seen that the convergence rate of the triangular array in Proposition 1.1 to its extreme value distribution is determined by the slower one between lnrn,(lnlnn)2lnn, nαn,lnrn and ρ(n), which is not faster than O((lnlnn)2lnn).

Example 2.1 Assume {ξn,j} is a standard normal triangular array, and for any n, {ξn,j} is an AR(1) process, that is

ξn,j=dnξn,j1+(1dn2)12Zj,j0,

where Zj is a sequence which is independent and identically distributed on the standard normal distribution. Assume

dn=(1ζlnn),ζ>0.

In this case, ρn,j=dnj=(1ζlnn)j, and δj=jζ in (1.2). The reasons are as follows.

(1ρn,j)lnn=((1(1ζlnn)j)lnn)=jζj(j1)ζ2lnn(1+o(1)).

Select ln=lnn(lnlnn)2, then

supjln|ρn,j|lnn|ρn,ln|lnnexp(ζlnlnn+lnlnn)0(n).

Select rn=[n(εn)12][(nln)12], whereεn=supjln|ρn,j|lnn. It can be verified that the proposition holds. In the conclusion, lnrn=ln[n(εn)12][(nln)12](lnnn)12lnlnn; it can be seen that ρ(n)=1lnn from (2.3); for nαn,lnrn, it is known from (2.4) that there exists the constant A, satisfying

2lnnlnlnn1+ρn,j2lnnlnlnn+A.

Hence, it can be obtained from normal distribution lemma (refer to [8]) that

nαn,lnrnnrnn2πj=lnn|ρn,j|(1ρn,j)12exp(2lnnlnlnn1+ρn,j)An3rnεnlnnexp(2lnn+lnlnn)=AnrnεnA(εn)12A1(lnn)12.

Considering (2.5), the conclusion can be simplified as follows:

supxR|P(Mnun)exp(ϑex)|(lnlnn)2lnnC.

Next, MATLAB R2016b is used for numerical simulation. Take ζ=1, then ϑ=0.641, denoted by

Δn=supxB|P(Mnun)exp(ϑex)|.

B is denoted as a certain known set, B represents the number of elements in the set B, and Δn¯ refers to the mean absolute error, i.e.,

Δn¯=1BxB|P(Mnun)exp(ϑex)|.

Corresponding diagram is as follows (Fig.1).

For different n, in order to calculate the probability P(Mnun), 10000 random numbers following this distribution are generated. The kernel density estimation with a normal kernel is used to obtain its distribution function. Take C=0.4, and denote Cn=C(ln(lnn))2lnn,B={x|x=5+0.1k,0k130,kZ}. The error table (Tab.1) is obtained through numerical simulation.

3 Relevant lemmas

Lemma 3.1  Assume {ξn,n1} is a stationary sequence of random variables sharing the same distribution function F and satisfying the Δ(un) condition; rn, ln are sequences of positive integers satisfying rn=o(n), ln=o(rn), αn,ln=o(rn). If n(1F(un))<C1, C1< , xR. Let kn=[nrn+ln]. Then

|P(Mnun)Pkn(M[nkn]un)|3C1lnrn+nαn,lnrn.

Proof From Lemma 3.3.1 and Lemma 3.3.2 in [7], it can be obtained that if the condition Δ(un) is satisfied, then

|P(Mnun)Pkn(M[ukn]un)|(2kn+1)P(M(I1)un<M(I1))+(kn1)αn,ln,

where M(I1)=maxiI1ξi, M(I1)=maxiI1ξi, I1={1,2,,[nkn]ln}, I1={[nkn]ln+1,,[nkn]}. Since n(1F(un))<C1,

P(M(I1)un<M(I1))lnP(ξ1>un)=lnnn(1F(un))C1lnn,

so

(2kn+1)P(M(I1)un<M(I1))(2nrn+ln+1)C1lnn=lnrn(2rnrn+ln+rnn)C13C1lnrn.

Besides, given ln=o(rn),

(kn1)αn,lnknαn,ln=nαn,lnrn+lnnαn,lnrn.

It can be seen from (3.2) and (3.3) the conclusion holds. Q.E.D. □

Lemma 3.2  Under the assumption of Proposition 1.1, for any finite subset K of the set {2,3,,n}, iK, δk<. Denote ρ(n)=supδk<,kK|(1ρn,k)lnnδk|. Then there exists the constant C>0 (related to the number of elements in the set K), such that

|P(ξn,kun,kK|ξn,1>un)P(2E+δkWkδk,kK)|C(ρ(n)+lnlnnlnn).

Proof Given

P(ξn,kun,kK|ξn,1>un)=0P(ξn,kun,kK|ξn,1=un+yun)ϕ(un+yun)un(1Φ(un))dy,

it can be obtained from Lemma 4.1 in [10] that

P(ξn,kun,kK|ξn,1=un+yun)=P(Zn,kvn,k,kK)P(Wkvk,kK),

where both (Zn,k,kK)T and (Wk,kK)T follow the multi-dimensional positive distribution. The following covariance matrix is as follows:

(ρn,i,j)i,jK=(ρn,|ij|ρn,iρn,j(1ρn,i2)12(1ρn,j2)12)i,jK,(ρi,j)i,jK=(δi+δjδ|ij|2(δiδj)12)i,jK,

vn,k=un1ρn,k1+ρn,kyρn,kun1ρn,k2 (kK), vk=δky2δk, and when n, vn,kvk (kK).

Hence,

|P(Zn,kvn,k,kK)P(Wkvk,kK)||P(Zn,kvn,k,kK)P(Wkvn,k,kK)|+|P(Wkvn,k,kK)P(Wkvk,kK)|=Jn,1+Jn,2.

For Jn,1, with normal comparison lemma (refer to [8]), there is

Jn,112πi,jK,i<j|ρn,i,jρi,j|(1max{ρn,i,j,ρi,j}2)12×exp(12(vn,i2+vn,j2)1+max{ρn,i,j,ρi,j}).

From (1.2), denote (1ρn,k)lnn=δk+gk(n), δk<, kK, where gk(n)=o(1) n, such that

ρn,i,j=ρn,|ij|ρn,iρn,j(1ρn,i2)12(1ρn,j2)12=(1ρn,i)+(1ρn,j)(1ρn,|ij|)(1ρn,i)(1ρn,j)(1ρn,i)12(1ρn,j)12(1+ρn,i)12(1+ρn,j)12=δi+gi(n)+δj+gj(n)δ|ij|g|ij|(n)(lnn)1(δi+gi(n))(δj+gj(n))(δi+gi(n))12(δj+gj(n))12(2(δi+gi(n))(lnn)1)12(2(δj1+gj(n))(lnn)1)12=((δi+δjδ|ij|)δiδjlnn+gi(n)(1+o(1))+gj(n)(1+o(1)))×12(δiδj)12(1+gi(n)δi+gj(n)δj+gi(n)gj(n)δiδjδi+δj2lnn(1+o(1)))12=((δi+δjδ|ij|)δiδjlnn+gi(n)(1+o(1))+gj(n)(1+o(1)))×12(δiδj)12(112(gi(n)δi(1+o(1))+gj(n)δj(1+o(1))δi+δj2lnn(1+o(1))))=ρi,j+14(δiδj)12(2δi+δjδ|ij|δi)gi(n)(1+o(1))12(δiδj)12g|ij|(n)+14(δiδi)12(2δi+δjδ|ij|δj)gj(n)(1+o(1))+((δi+δj)(δi+δjδ|ij|)8(δiδj)1212(δiδj)12)1lnn(1+o(1)),

i.e.,

ρn,i,jρi,j=14(δiδj)12(2δi+δjδ|ij|δi)gi(n)(1+o(1))12(δiδj)12g|ij|(n)+14(δiδj)12(2δi+δjδ|ij|δj)gj(n)(1+o(1))+((δi+δj)(δi+δjδ|ij|)8(δiδj)1212(δiδj)12)1lnn(1+o(1)).

From (3.7)−(3.9), there exists the constant C1 (depending on K),

Jn,1C1(kKgk(n)+1lnn).

For Jn,2, assume the density function of (Wk,kK)T is f(x), where

f(x)=1(2π)K|ρ|12exp(12xTρ1x).

From the positive definiteness of ρ, xRK (K represents the number of elements in the set K), and there is always exp(12xTρ1x)1, such that

|vn,kf(x1,x2,,xK)dx1dx2dxKvkf(x1,x2,,xK)dx1dx2dxK|=|vkvn,kf(x1,x2,,xK)dx1dx2dxK|1(2π)K|ρ|12kK|vn,kvk|.

For vn,k=un1ρn,k1+ρn,kyρn,kun(1ρn,k2)12,kK, and with the help of the assumption in Lemma 3.2 and un2=2lnnlnlnn+ O(1), there is

un1ρn,k1+ρn,k=((2lnnlnlnn+O(1))(lnn)1(δk+gk(n))2δk(lnn)1+gk(n)(lnn)1)12=(δk+gk(n)δk2lnlnnlnn+o(lnlnnlnn))12=δk12+12δk12gk(n)(1+o(1))14δk12lnlnnlnn(1+o(1)),

ρn,kun(1ρn,k2)12=(1δk(lnn)1+gk(n)(lnn)1)(4δkgk(n)2δklnlnnlnn(1+o(1)))12=(1δk(lnn)1gk(n)(lnn)1)×[12δk12+14δk32gk(n)(1+o(1))+18δk12lnlnnlnn(1+o(1))]=12δk12+14δk32gk(n)(1+o(1))+18δk12lnlnnlnn(1+o(1)).

From (3.12) and (3.13), there is

kK|vn,kvk|=kK|un1ρn,k1+ρn,kyρn,kun(1ρn,k2)12(δk12y2(δk)12)|=kK|(12δk12y4δk32)gk(n)(1+o(1))14δk12(1+y2δk)lnlnnlnn(1+o(1))|.

It is known from (3.10), (3.11), and (3.14) that there exists such constant C2 that for any kK,

Jn,2C2(gk(n)+lnlnnlnn).

It can be seen from (3.6), (3.10), and (3.15) that there exists the constant C3, such that

|P(Zn,kvn,k,kK)P(Wkvk,kK)|C3(kKgk(n)+lnlnnlnn).

For (3.5), based on Mills’s Inequality

ϕ(x)(1x2)1Φ(x)ϕ(x)x,x>0,

we can get

exp(yy22un2)ϕ(un+yun)un(1Φ(un))11un2exp(yy22un2).

Let C=max{C1,C3} ρ(n)=supδk<|(1ρn,klnn)δk|. From (3.5) and (3.17)‒(3.18),

|P(ξn,kun,kK|ξn,1>un)P(E2+δkWkδk,kK)|C(kKgk(n)+lnlnnlnn)C(ρ(n)+lnlnnlnn).

Q.E.D. □

4 Proofs of theorems

Proof of Theorem 2.1 According to triangular inequality, we get

|P(Mnun)exp(ϑex)||P(Mnun)exp(nP(j=2rn{ξn,jun},ξn,1>un))|+|exp(nP(j=2rn{ξn,jun},ξn,1>un))exp(ϑex)|=In,1+In,2.

For In,1, denote M1,p=max2ipξn,i, then Mn=M0,n. Since the function y=(1+x)1x monotonically decreases on (1,0), and limx0(1+x)1x=e, considering [9] and Lemma 3.1, there exists the constant C1 (related with the selection of un ), such that

P(Mnun)Pkn(M[nkn]un)+3C1lnrn+nαn,lnrn(1[nkn]P(ξn,1>un,M1,[nkn]un))kn+3C1lnrn+nαn,rnlnexp(nP(ξn,1>un,M1,[nkn]un))+3C1lnrn+nαn,lnrn.

For the reverse direction of Inequality (4.2), sn is a sequence of positive integers, and rn=o(sn) . Let tn=nsn+ln. It is known from Lemma 3.1 that there exists constant C1, such that

|P(Mnun)Ptn(M[ntn]un)|3C1lnsn+nαn,lnrn,

and from rn=o(sn), (4.2), and (4.3), it can be obtained that

|Pkn(M[nkn]un)Ptn(M[ntn]un)|3C1(lnrn+lnsn)+2nαn,lnrn.

Let f(n)=3C1(lnrn+lnsn)+2nαn,lnrn. From (4.4), we get

|Pkn(M[nkn]un)Ptn(M[ntn]un)|f(n),

i.e.,

1((1P(M[ntn]>un))tn+f(n))1knP(M[nkn]>un)1((1P(M[ntn]>un))tnf(n))1kn,

where

1((1P(M[ntn]>un))tn+f(n))1kn=1(1tnP(M[ntn]>un)+o(tnP(M[ntn]>un))+f(n))1kn=1(11kn(tnP(M[ntn]>un)+o(tnP(M[ntn]>un))f(n))+o(1kn(tnP(M[ntn]>un)+o(tnP(M[ntn]>un))f(n))))=tnknP(M[ntn]>un)(1+o(1))f(n)kn(1+o(1)).

By the same token,

1((1P(M[ntn]>un))tnf(n))1kn=tnknP(M[ntn]>un)(1+o(1))+f(n)kn(1+o(1)).

From (4.6) and (4.7), it is known that

|P(M[nkn]>un)tnknP(M[ntn]>un)|o(tnknP(M[ntn]>un))+f(n)kn(1+o(1)).

For the sake of convenience, letp=[ntn], q = [nkn]. Then, based on (3.8) and P(Mp>un) = P(Mpq) > un,Mpq,p un)+P(Mq>un), there is

P(Mp>un)knkntnP(Mpq>un,Mpq,pun)+o(tnkntnP(Mp>un))+f(n)kntn(1+o(1))knkntni=1pqP(ξn,i>un,Mi,q+i1un)+o(tnkntnpP(ξn,1>un))+f(n)kntn(1+o(1))knkntnpP(ξn,1>un,M1,qun)+o(tnkntn×pn)+f(n)kntn(1+o(1)).

Hence, from (4.3), we get

P(Mnun)Ptn(M[ntn]un)3C1lnrnnαn,lnrn(1(knkntnpP(ξn,1>un,M|1,qun)+o(tnkntn×pn)+f(n)kntn(1+o(1))))tn+3C1lnrn+nαn,lnrnexp(nP(ξn,1>un,M1,[nkn]))+o(tnkntn×pn)+f(n)kntn3C1lnrnnαn,lnrn.

Since tnknrnsn, it is known from (4.2)‒(4.8) that there exists the constant C2, such that

|In,1|(lnrn+nαn,lnrn)C2.

For In,2, from [9, p.39], it is known that

nP(j=2rn{ξn,jun,ξn,1>un})=nP(ξn,1>un)P(j=2rn({ξn,jun}|ξn,1>un))=ex(1(lnlnn)216lnn(1+o(1)))P(j=2rn({ξn,jun}|ξn,1>un)).

It can be seen from the proofs of relevant Proposition 1 in [8, p.682] that

limmlimnP(j=2m{ξn,jun}|ξn,1>un)ϑ,

limmlimnsupP(j=mrn{ξn,jun}|ξn,1>un)0.

Based on (4.12), (4.13), and Lemma 3, there exists the constant C3, such that

|P(j=2rn{ξn,jun}|ξn,1>un)ϑ|C3(ρ(n)+lnlnnlnn).

From (4.11) and (4.14) it is known that

nP(j=2rn{ξn,jun,ξn,1>un})ex(1(lnlnn)216lnn(1+o(1)))(ϑ+C3(ρ(n)+lnlnnlnn))=ϑex+exC3ρ(n)(1+o(1))exϑ(lnlnn)216lnn(1+o(1)).

For any real numbers x, y satisfyingxy<ln2, with Taylor’s Theorem, there exists θ(0<θ<1), such that

eyex=ex(exy1)=ex(xy+12(xy)2eθ(xy)).

Hence, from (4.14) and (4.15), it is known that

In,2|exC3ρ(n)(1+o(1))exϑ(lnlnn)216lnn(1+o(1))|,

and based on (4.1), (4.10), and (4.17), there exists the constant C such that (2.2) is established. Q.E.D. □

References

[1]

Berman S.. Limit theorems for the maximum term in stationary sequences. Ann. Stat. 1964; 35: 502–516

[2]

Chen S.Q. , Huang, J.W.. Rates of convergence for asymmetric normal distribution. Stat. Probab. Lett. 2014; 84: 40–47

[3]

Hsing T., Hüsler, J. , Leadbetter, M.R.. On the exceedance point process for a stationary sequence. Probab. Theory. Rel. 1988; 78: 97–112

[4]

Hsing T., Hüsler, J. , Reiss, R.-D.. Maxima of normal random vectors: Between independence and complete dependence. Stat. Probab. Lett. 1989; 7: 283–286

[5]

Hsing T., Hüsler, J. , Reiss, R.-D.. The extremes of a triangular array of normal random variables. Ann. Appl. Probab. 1996; 6(2): 671–686

[6]

LeadbetterM.R., Lindgren, G. , Rootzen, H., Extremes and Related Properties of Random Sequences and Processes, New York: Springer-Verlag, 1983

[7]

Liao X., Peng, Z.X., Nadarajah, S. , Wang, X.Q.. Rates of convergence of extremes from skew-normal samples. Stat. Probab. Lett. 2014; 84: 158–168

[8]

Mittal Y. , Ylvisaker, D.. Limit distributions for the maxima of stationary Gaussian processes. Stoch. Proc. Appl. 1975; 3: 1–18

[9]

O’Brian . Extreme values for stationary and Markov sequences. Ann. Probab. 1987; 15: 281–291

[10]

Rootźen . The rate of convergence of extremes of stationary normal sequences. Adv. Appl. Probab. 1983; 15(1): 54–58

RIGHTS & PERMISSIONS

Higher Education Press 2025

AI Summary AI Mindmap
PDF (1798KB)

254

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/