Arbitrary functional Glivenko-Cantelli classes and applications to different types of dependence
Harouna Sangar\'e, Gane Samb Lo, Mamadou Cherif Moctar Traor\'e

TL;DR
This paper develops a broad theoretical framework for Glivenko-Cantelli classes applicable to various dependent stationary processes, extending classical results and comparing with existing literature.
Contribution
It introduces a general approach to establish functional Glivenko-Cantelli classes for arbitrary stationary processes using entropy numbers and a strong law of large numbers.
Findings
Established GC classes for diverse dependence structures
Compared new results with existing literature
Extended classical empirical process theory to dependent data
Abstract
Using a general strong law of large number proved by Sangar\'e and Lo (2015) and the entropy numbers, we provide functional Glivenko-Cantelli (GC) classes for arbitrary stationary real-valued random variables (rrv's). Next, the general results are particularized for different types of dependence (association, -mixing, in particular) and compared with available results in the literature.
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.
Arbitrary functional Glivenko-Cantelli classes and applications to different types of dependence
Harouna Sangaré
,
Gane Samb Lo
and
Mamadou Cherif Moctar Traoré
Abstract.
Using a general strong law of large number proved by Sangaré and Lo (2015) and the entropy numbers, we provide functional Glivenko-Cantelli (GC) classes for arbitrary stationary real-valued random variables (rrv’s). Next, the general results are particularized for different types of dependence (association, -mixing, in particular) and compared with available results in the literature.
† Harouna Sangaré
DER MI,Faculté des Sciences et Techniques (FST), USTT-B, Mali (main affiliation)
LERSTAD, Gaston Berger University, Saint-Louis, Sénégal.
Institutional emails : [email protected], [email protected], [email protected]
Own email : [email protected]
†† Gane Samb Lo.
LERSTAD, Gaston Berger University, Saint-Louis, Sénégal (main affiliation).
LSTA, Pierre and Marie Curie University, Paris VI, France.
AUST - African University of Sciences and Technology, Abuja, Nigeria
Institutional emails :[email protected], [email protected]
Own email : [email protected]
Permanent address : 1178 Evanston Dr NW T3P 0J9, Calgary, Alberta, Canada.
††† Mamadou Cherif Moctar Traoré.
LERSTAD, Gaston Berger University, Saint-Louis, Sénégal.
Keywords. Association, -mixing, Stationarity, Entropy number, Glivenko-Cantelli class
AMS 2010 Mathematics Subject Classification: 62G20; 60G10
1. Introduction
Let be a sequence of real-valued random variables (rrv’s) defined on the same probability space and associated to the same cumulative distribution function (cdf) . Let be the class of all measurable functions with . Let us defined the functional empirical probability based on the first observations, , by
[TABLE]
which will be centered at the mathematical expectations
[TABLE]
In this paper, we are interested by functional Glivenko-Cantelli classes, that is classes for which we have
[TABLE]
We might also consider a class of measurable sets in and define
[TABLE]
with
[TABLE]
Taking in Definition (1.1) or in Definition (1.2), leads to the classical empirical function
[TABLE]
which in turn gives the Glivenko-Cantelli law for independent and identically distributed (iid) sequences under the form :
[TABLE]
Such a result, also known as the fundamental theorem of statistics is the frequentist paradigm (in opposition to the Bayesian paradigm) in statistics. In the form of (1.3), the Glivenko-Cantelli law has gone trough a large number of studies for a variety of type of dependence. Also, it has been extensively used in statistical theory both for finding plug-in asymptotically efficient estimators and the related statistical tests based on the Donsker theorem that we will not study here.
To give a few examples, we cite the following results, Billingsley (1968) showed the convergence in law on of the empirical process for -mixing rrv’s under the condition . Yoshihara (1975) obtained the same result for -mixing under the condition on the mixing coefficient with . This result has been first improved by Shao (1995) by only assuming , then by Shao and Yu (1996) who suppose that . Rio (2000) obtained a best condition . Similar results are given by in Shao and Yu (1996) for -mixing rrv’s, Doukhan * et al.* (1995) for -mixing rrv’s. For the associated dependence, Yu (1993) obtained the convergence under the condition , . Next, Shao and Yu (1996) weakened the covariance condition . Louhichi (2000) gave another proof and a result improvement with .
As to the Glivenko-Cantelli type theorems for associated random variables, Bagai and Prakasa (1991) have first proposed an estimator for the survival function, discussed its asymptotic properties and then gave Glivenko-Cantelli theorem under moment condition, namely , for some , for stationary sequences in some compact subset. Yu (1993) dropped the stationary assumption and considered a sequence of associated random variables having the same marginal distribution function. He obtained a Glivenko-Cantelli theorem under the following conditions : he first supposed that the distribution function is continuous and then
[TABLE]
and if the sequence is stationary, then the last condition can be weakened to
[TABLE]
However, functional versions seem not to have been developed for dependent data while they are far more interesting than restricting to the particular case of . Besides, the functional version has the advantage to be linear in the sense that
[TABLE]
which allows the use of more mathematical latitudes.
In this paper, we directly address the functional Glivenko-Cantelli as introduced in Theorem in van der Vaart and Wellner (1996). We use general conditions of the covariances to establish GC-classes regardless the dependence structures. The obtained conditions are then applied to specific types of dependence.
The main achievements are Theorem 2, as a very general functional Glivenko-Cantelli laws for arbitrary law under under Conditions (5.6) and (5.7) and Theorem 3 general Glivenko-cantelli laws for the real-valued empirical functions under Conditions (5.9) and (5.10), also to be check for different types of dependence. Next, we will focus on the second type of Glivenko-Cantelli classes for -mixing and associated sequences with new results to be compared with previous results.
That functional approach needs the use of concentration numbers we define in the next section. We will also need to make a number of recalls on dependance types as -mixing and associated sequences and other tools.
Taking that into account leads us to the following organization of the paper. The main result concerning the arbitrary stationary Glivenko-Cantelli classes will be stated in Section 5. But before that, Section 2 will devote to entropy numbers and Vapnik-Červonenkis classes, Section 3 to recall of associated sequences, Section 4 to the recall of the Sangaré and Lo (2015) general law which will be instrumental to our proofs. In Section 6, we focus on GC-classes regarding real-valued empirical function under types of dependence. 7 concerns concluding remarks. The paper is ended by the Appendix, where is postponed the detailed proof of the main theorem, in Section 8. Reader familiar with entropy numbers or associated sequence may skip the related section to go directly to the section of their interest.
2. Entropy numbers and Vapnik-Červonenkis
It might be perceived that the following recall on the entropy numbers, which comes from combinatorial Theory, makes the paper heavier. But, in our view, it may help the reader who is not well aware of such techniques. Let be an ordered real normed space meaning that the order is compatible with the operations in the following sense
[TABLE]
A bracket set of level in is any set of the form
[TABLE]
For any subset of , the bracketing entropy number at level , denoted is the minimum of the numbers for which we have bracket sets (or simply brackets) at level covering , where the ’s do not necessarily belong to . The bracketing entropy number is closely related to the Vapnick-Červonenkis index (VC-index) of a Vapnick-Červonenkis set or class (VC-class or VC-set).
To define a VC-set, we need to recall some definitions. A subset of is picked out by a subclass of the power set from if and only if is element of . Next, is shattered by if and only if all subsets of are picked out by from . Finally, the class is a VC-class if and only if there exists an integer such that no set of cardinality is shattered by . The minimum of those numbers minus one is the index of that VC-class. The VC-class is the most quick way to bound bracketing entropy numbers , as stated in van der Vaart and Wellner (1996) : If is a VC-class of index , then
[TABLE]
where and are universal constants.
Finally, for a class of real-value functions , we may defined the bracketing entropy number associated to is the bracketing entropy number of the class of sub-graphs of elements
[TABLE]
in endowed with the product norm which still is a normed space. We denoted by to distinguish with the bracketing number using the norm of the functions . As well, is a VC-supg-class if and only if is a VC-class and .
We will use such entropy numbers for formulating VC-classes.
Since the results are applied to associated sequences, we also proceed to a brief recall on them.
3. Recall on associated sequences
To begin with, we remind some useful results on associated data that find in Prakasa Rao (2012).
Lemma 1**.**
(Newman (1980)). Suppose that are two rv’s with finite variance and, and are complex valued functions on with bounded derivatives and . Then
[TABLE]
We also have :
Lemma 2**.**
Let and be associated random variables with absolutely continuous distributions. Assume that the marginal densities and are bounded by . Then, for every ,
[TABLE]
*where .
Optimizing the choice of on the previous result, they find the following important inequality
Corollary 1**.**
Under the same assumptions as in Lemma 2 if , one has that
[TABLE]
Lemma 3**.**
(Bagai and Prakasa (1991)). Suppose the pair and are associated random variables with bounded continuous densities and , respectively. Then there exists an absolute constant such that
[TABLE]
Finally, the main tool used in our main theorem is the Arbitrary Strong Law of Large number we describe below.
4. The Sangaré-Lo SLNN, -mixing and important other tools
We begin with this useful result proved by Sangaré and Lo (2015).
Lemma 4**.**
(Sangaré and Lo (2015)). Let be an arbitrary sequence of rv’s, and let be a sequence of measurable functions such that , for and . If for some ,
[TABLE]
and for some ,
[TABLE]
hold, then
[TABLE]
Remark. We say that the sequence satisfies the (GCIP) whenever Conditions (4.1) and (4.2) hold, and we denote , the class of measurable functions for which (GCIP) holds.
Since we are also going to apply our results to sequences verifying the -mixing condition, we make a brief summary of this notion.
4.1. -mixing
Let us have a brief recall on -mixing. Let () be a probability space and , two sub algebras of . The -mixing coefficient is given by
[TABLE]
We remind that we have (see Doukhan (1994)) for -measurable and -measurable, -integrable and -integrable respectively with , and ,
[TABLE]
and
[TABLE]
We define the strong mixing coefficient by
[TABLE]
where is the algebra generated by the variables , . We say that is -mixing if as . For some further clarification on this point, the reader may have a quick look at Doukhan (1994).
Let us just cite two useful analysis tools.
4.2. Two useful lemmas
Next here is the Kronecker lemma. First, here is the Cesàro lemma.
Lemma 5**.**
Let be a sequence of finite real numbers converging to , then sequence of arithmetic means
[TABLE]
also converges to .
For a proof, see also Loève (1997) and Lo (2018b) (page 367). Next, we recall the Kronecker lemma.
Lemma 6**.**
(Kronecker Lemma). If is an increasing sequence of positive numbers and is a sequence of finite real numbers such that converges to a finite real number , then
[TABLE]
For a proof, see Loève (1997) or Lo (2018b) (page 369).
In the next section, we provide general functional Glivenko-Cantelli classes.
5. Our results
In this section, we give general functional Glivenko-Cantelli classes. These results will be used in Section 6 to establish GC-classes for real-valued empirical function under types of dependence.
5.1. General functional GC-classes
Let us begin by giving a slight different version of Theorem 2.4.1 in van der Vaart and Wellner (1996), page 122.
Theorem 1**.**
*Let be an arbitrary stationary sequence of rrv’s with common cdf .
*a) Let be a class of measurable set such that *
(a1) For any , ,
(a2) For any , , as .
Then is GC-class, that is
[TABLE]
*b) Let be a class of measurable set such that
(b1) For any , ,
(b2) For any , , as .
Then is GC-class, that is
[TABLE]
Proof. The proof of the Theorem 1 is postponed in the Appendix (Section 8) .
Remark (R2). If we apply Part (a) to , Condition (a1) can be dropped since it is VC-class of index 2. Indeed, for with . The subset cannot be picked out by from since, for any , will be of on the five sets : (for ), (for ), (for ) and (for ).
Then finding GC-classes for reduces to establishing Condition (b1). For now, we are going to focus on the application of GC-classes of the functional empirical process for , that is, on results as in Formula (1.3). The focus will be on types of dependence, given it is known that is GC-class for iid data. Using the GCIP conditions in Lemma 4 leads to our applicable results as follows.
Theorem 2**.**
*Let be an arbitrary stationary sequence of rrv’s with common cdf .
*a) Let be a class of measurable set such that *
(a1) For any , ,
(a2) For any , the following conditions hold : for some ,
[TABLE]
and
[TABLE]
Then is GC-class, that is
[TABLE]
*b) Let be a class of measurable set such that
(b1) For any , ,
(b2) For any , the following conditions hold : for some ,
[TABLE]
and
[TABLE]
Then is GC-class, that is
[TABLE]
Proof. It follows the lines of that of Theorem 1 in the Appendix (Section 8)
5.2. GC-classes for the empirical function for dependent data
As already mentioned, let us focus on , on
[TABLE]
and
[TABLE]
Now, we apply Part (a) of Theorem 2 for , to have
Theorem 3**.**
Let , ,, , be an arbitrary stationary and square integrable sequence of rrv’s, defined on a probability space . We have
[TABLE]
whenever the following general conditions hold : for some
[TABLE]
and
[TABLE]
Remark (R3). Since the expressions in (5.9) and (5.10) are zero whenever the variables are independent and identically distributed (iid), the iid case holds without any further condition, which is the classical Glivenko-Cantelli theorem.
Proof. We have to apply Part (a) of Theorem 2 for , . The conditions become
[TABLE]
and
[TABLE]
.
Let us focus on two types of dependence : association and -mixing.
6. Application to the real-valued empirical function
In the present section, we use the Theorem 3 to give applications to association and -mixing.
6.1. Associated case
Corollary 2**.**
Suppose that the ’s are associated and form a stationary and square integrable and have bounded continuous pdf, then
[TABLE]
holds whenever we have
[TABLE]
Proof. ’s are associated (see Section (3, page3)). By applying Lemma (3, page 3), conditions (5.9) and (5.10) become the following one, for with ,
[TABLE]
and
[TABLE]
Now since the sequence is second order stationary, then (6.2) and (6.3) will be equivalent to
[TABLE]
Which in turn becomes, by the kronecker lemma (see Lemma 6, page 6),
[TABLE]
and finally
[TABLE]
.
We rediscover the result by Yu (1993).
Corollary 3**.**
Suppose that the ’s are associated and form a stationary and square integrable and have bounded continuous pdf, then
[TABLE]
holds whenever we have
[TABLE]
Proof. Since is strictly increasing and continuous, we can use the sequence , . The ’s are obviously associated, stationary and square integrable -uniformly distributed random variables on and we have for each
[TABLE]
where is the real empirical function based on , , , . So
[TABLE]
holds if and only if
[TABLE]
and
[TABLE]
where with . That are
[TABLE]
and
[TABLE]
If the sequence is second order stationary, then (6.7) implies (6.8), since
[TABLE]
for And (6.7) may be written as
[TABLE]
This is our general condition under which we have the Glivenko-Cantelli class for second order stationary associated sequence. Then, by the Kronecker lemma (see Lemma 6, page 6), we have the Glivenko-Cantelli class if
[TABLE]
Clearly, by the Cesàro lemma (see Lemma 5, page 5), Formula (6.10) implies
[TABLE]
By the Lemma (1, page 1), since is finite, (6.11) reduces to
[TABLE]
.
Such a result is also obtained by Yu (1993) for the strong convergence of empirical distribution function for associated sequence with identical and continuous distribution.
6.2. -mixing case
We already made a brief recall on -mixing in Subsection (4.1) in Section (4). We are now going to provide applications to it.
Corollary 4**.**
Suppose that the ’s form a -mixing stationary and square integrable sequence of random variables with mixing condition . Then
[TABLE]
holds whenever we have
[TABLE]
Proof. In this case, our conditions become
[TABLE]
Finally, our condition reduces to
[TABLE]
.
Important remark. In the case of -mixing sequences, we do not need whole function . Instead we may fix and consider the modulus related to the sequence ’s. It is clear that
[TABLE]
We have the Glivenko-Cantelli theorem if and only if
[TABLE]
The same can be done for any particular class by using the associated sequences ’s and the mixing modulus, and get the condition
[TABLE]
7. Conclusion
In a coming paper, we will focus on the functional Glivenko-Cantelli classes with a considerable classes of functions and its applications to a number of situations.
8. Appendix
Proof of the Theorem 1. Consider a class of measurable real functions such that each . Let be finite, for every . Then there is a sequence of intervals , such that for every , , and and such that . For any , there exist and such as and
[TABLE]
On the other hand we have, by the monotonicity of the probability, that
[TABLE]
Therefore
[TABLE]
Next
[TABLE]
Thus
[TABLE]
Since for every , , we have by the Lemma (4, page 4), it follows that
[TABLE]
By applying the upper limit on the left-hand side in (8), we get for every
[TABLE]
.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bagai and Prakasa (1991) Bagai, I. and Prakasa Rao, B.L.S. (1991). Estimation of the survival function for stationary associated processes, Statist. Probab. Lett., 12, 385-391.
- 2Billingsley (1968) Billingsley, P. (1968). Convergence of probability measures , Wiley, New York.
- 3Csörgő et al. (1986) Csörgő, M., Csörgő, S., Horváth, L. (1986). An asymptotic theory for empirical reliability and concentration processes. (Lect. Notes Stat., vol.33) Berlin Heidelberg New York; Springer
- 4Doukhan (1994) Doukhan, P. (1994). Mixing properties and exemples . ISBN 0-387-94214-9.© Springer-Verlag New York, Inc.
- 5Doukhan et al. (1995) Doukhan, P., Massart, P. and Rio, E. (1995). Iinvariance principles for the empirical measure of a weakly dependent process, Ann. Inst. H. Poincarré 31 393-427.
- 6Lo et al. (2016) Lo, G.S.(2016). Weak Convergence (IA). Sequences of random vectors. SPAS Books Series . Saint-Louis, Senegal - Calgary, Canada. Doi : 10.16929/sbs/2016.0001. Arxiv : 1610.05415. ISBN : 978-2-9559183-1-9
- 7Lo (2018 b) Lo, G.S.(2018). Mathematical Foundation of Probability Theory . SPAS Books Series . Saint-Louis, Senegal - Calgary, Canada. Doi : http://dx.doi.org/10.16929/sbs/2016.0008. Arxiv : arxiv.org/pdf/1808.01713
- 8Lo et al. (20116) Lo G.S., Sangare H. and Ndiaye C. H. (2016). A Review on asymptotic normality of sums of associated random variables. Afrika Statistika . Volume 11(1), pp 855-867 Doi : http://dx.doi.org/10.16929/as/2016.855.79
