School of Mathematics and Information, China West Normal University, Nanchong 637002, China
liuxl18@cwnu.edu.cn
Show less
History+
Received
Accepted
Published
Issue Date
Revised Date
2025-07-30
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.
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 is a stationary standard normal sequence with correlation coefficient Cov, and the second sequence of random variables is an independent standard normal sequence. [1] proved that when
is satisfied, the limit distribution of the maximum of the first sequence 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 satisfying the convergence of to a certain constant ( represents a distribution function with standard normal distribution), the convergence rate of
is , where
To avoid the clustering situation, we take a standard normal triangular array , , into account, and for any fixed , 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 ,
where , and the following conclusion was drawn:
Proposition 1.1For the standard normal triangular array mentioned above, if condition (1.2) holds, there will exist two sequences of positive integerssatisfying when ,
and
and
Then
where Normalizing constants and are defined as follows:
and
If for all , it satisfies , then , where represents a standard exponential distribution independent of , and is a joint normal distribution with mean zero. There is
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 be a sequence of random variables. If for the subsets = and of the set , , then is a sequence of real numbers. We say
is a mixing coefficient. If for a certain sequence satisfying ), we say satisfies the condition.
Theorem 2.1For the triangular array in Proposition 1.1, denote , and under the assumption of Proposition 1.1, there exists a constant , such that
where
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 and , which is not faster than .
Example 2.1 Assume is a standard normal triangular array, and for any , is an AR(1) process, that is
where is a sequence which is independent and identically distributed on the standard normal distribution. Assume
In this case, , and in (1.2). The reasons are as follows.
Select , then
Select , where. It can be verified that the proposition holds. In the conclusion, ; it can be seen that from (2.3); for , it is known from (2.4) that there exists the constant , satisfying
Hence, it can be obtained from normal distribution lemma (refer to [8]) that
Considering (2.5), the conclusion can be simplified as follows:
Next, MATLAB R2016b is used for numerical simulation. Take , then , denoted by
is denoted as a certain known set, represents the number of elements in the set , and refers to the mean absolute error, i.e.,
Corresponding diagram is as follows (Fig.1).
For different , in order to calculate the probability , 10000 random numbers following this distribution are generated. The kernel density estimation with a normal kernel is used to obtain its distribution function. Take , and denote . The error table (Tab.1) is obtained through numerical simulation.
3 Relevant lemmas
Lemma 3.1Assumeis a stationary sequence of random variables sharing the same distribution functionand satisfying thecondition; ,are sequences of positive integers satisfying,,. If,,. Let . Then
Proof From Lemma 3.3.1 and Lemma 3.3.2 in [7], it can be obtained that if the condition is satisfied, then
where , , , . Since ,
so
Besides, given ,
It can be seen from (3.2) and (3.3) the conclusion holds. Q.E.D. □
Lemma 3.2Under the assumption of Proposition 1.1, for any finite subsetof the set , , . Denote. Then there exists the constant (related to the number of elements in the set ), such that
where both and follow the multi-dimensional positive distribution. The following covariance matrix is as follows:
, , and when , .
Hence,
For , with normal comparison lemma (refer to [8]), there is
From (1.2), denote , , , where , such that
i.e.,
From (3.7)−(3.9), there exists the constant (depending on ),
For , assume the density function of is , where
From the positive definiteness of , ( represents the number of elements in the set ), and there is always , such that
For , and with the help of the assumption in Lemma 3.2 and , there is
From (3.12) and (3.13), there is
It is known from (3.10), (3.11), and (3.14) that there exists such constant that for any ,
It can be seen from (3.6), (3.10), and (3.15) that there exists the constant , such that
For (3.5), based on Mills’s Inequality
we can get
Let . From (3.5) and (3.17)‒(3.18),
Q.E.D. □
4 Proofs of theorems
Proof of Theorem 2.1 According to triangular inequality, we get
For , denote , then . Since the function monotonically decreases on , and e, considering [9] and Lemma 3.1, there exists the constant (related with the selection of ), such that
For the reverse direction of Inequality (4.2), is a sequence of positive integers, and . Let . It is known from Lemma 3.1 that there exists constant , such that
and from , (4.2), and (4.3), it can be obtained that
Let . From (4.4), we get
i.e.,
where
By the same token,
From (4.6) and (4.7), it is known that
For the sake of convenience, let = Then, based on (3.8) and = > , there is
Hence, from (4.3), we get
Since , it is known from (4.2)‒(4.8) that there exists the constant , such that
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 中Eng×
Note: Please be aware that the following content is generated by artificial intelligence. This website is not responsible for any consequences arising from the use of this content.