2008
DOI: 10.1051/ps:2007053
|View full text |Cite
|
Sign up to set email alerts
|

Dependent Lindeberg central limit theorem and some applications

Abstract: Abstract.In this paper, a very useful lemma (in two versions) is proved: it simplifies notably the essential step to establish a Lindeberg central limit theorem for dependent processes. Then, applying this lemma to weakly dependent processes introduced in Doukhan and Louhichi (1999), a new central limit theorem is obtained for sample mean or kernel density estimator. Moreover, by using the subsampling, extensions under weaker assumptions of these central limit theorems are provided. All the usual causal or non… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
66
0
1

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(67 citation statements)
references
References 14 publications
0
66
0
1
Order By: Relevance
“…Therefore we present an alternative route to establishing subsampling consistency, by considering the θ-weak dependence literature of Doukhan and Louhichi (1999) and Bardet et al (2008). By combining the proofs of Theorem 11.3.1 of Politis et al (1999) and Lemma 3.1 of Ango-Nze et al (2003) it is possible to establish the desired consistency rate under assumptions typical to the literature; for completeness we present the result in Appendix B with proof.…”
Section: Subsamplingmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore we present an alternative route to establishing subsampling consistency, by considering the θ-weak dependence literature of Doukhan and Louhichi (1999) and Bardet et al (2008). By combining the proofs of Theorem 11.3.1 of Politis et al (1999) and Lemma 3.1 of Ango-Nze et al (2003) it is possible to establish the desired consistency rate under assumptions typical to the literature; for completeness we present the result in Appendix B with proof.…”
Section: Subsamplingmentioning
confidence: 99%
“…By combining the proofs of Theorem 11.3.1 of Politis et al (1999) and Lemma 3.1 of Ango-Nze et al (2003) it is possible to establish the desired consistency rate under assumptions typical to the literature; for completeness we present the result in Appendix B with proof. The application of Theorem 4 to the problem of our paper is immediate, using Theorem 3 to identify Z as σ t is positive -to ensure λ-and θ-weak dependence (see Doukhan and Louhichi (1999) and Bardet et al (2008) for definitions). The validity of subsampling under weak dependence is proved in Appendix B under a condition of polynomial decay of the weak dependence coefficients r .…”
Section: Subsamplingmentioning
confidence: 99%
“…To obtain decent performance over a range of data processes, either the Parzen or a trapezoidal taper is recommended. 4 While the MAC approach of Robinson (2005) is also applicable, we omit to study it here because it is not based upon self-normalization, which is the focus of our paper. In summary, we provide a viable framework for conducting inference for the mean, supplying a unified asymptotic theory that covers all different types of memory under a single umbrella.…”
Section: Discussionmentioning
confidence: 99%
“…Concluding remark. It is well known in the literature that processes satisfying some mixing properties have interesting statistical properties (see [16,17,18,20,3,27,34,38] and many others) such as moment inequalities, central limit theorem ... The mixing properties satisfied by our models, namely (η u,v )-mixing properties, are not standard ones and some more work is needed to get these statistical properties.…”
Section: 23mentioning
confidence: 99%