Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-23T04:32:42.136Z Has data issue: false hasContentIssue false
  • English
  • Français

On degenerate sums of m-dependent variables

Part of: Combinatorial probability Stochastic processes Limit theorems

Published online by Cambridge University Press:  30 March 2016

Svante Janson
Svante Janson*
Affiliation:
Uppsala University
*
∗Postal address: Department of Mathematics, Uppsala University, PO Box 480, SE-751 06 Uppsala, Sweden. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It is well known that the central limit theorem holds for partial sums of a stationary sequence (Xi) of m-dependent random variables with finite variance; however, the limit may be degenerate with variance 0 even if var(Xi) ≠ 0. We show that this happens only in the case when Xi – EXi = Yi – Yi–1 for an (m − 1)-dependent stationary sequence (Yi) with finite variance (a result implicit in earlier results), and give a version for block factors. This yields a simple criterion that is a sufficient condition for the limit not to be degenerate. Two applications to subtree counts in random trees are given.

Keywords

m-dependentstationary sequenceblock factorrandom tree

MSC classification

Primary: 60G10: Stationary processes
Secondary: 60F05: Central limit and other weak theorems 60C05: Combinatorial probability
Type
Research Papers
Information
Journal of Applied Probability , Volume 52 , Issue 4 , December 2015 , pp. 1146 - 1155
Copyright
Copyright © Applied Probability Trust 2015 

References

Aaronson, J., Gilat, D., Keane, M. and De Valk, V. (1989). An algebraic construction of a class of one-dependent processes. Ann. Prob. 17, 128–143.CrossRefGoogle Scholar
Bradley, R. C. (1980). A remark on the central limit question for dependent random variables. J. Appl. Prob. 17, 94–101.CrossRefGoogle Scholar
Bradley, R. C. (2007a). Introduction to Strong Mixing Conditions , Vol. 1. Kendrick Press, Heber City, UT.Google Scholar
Bradley, R. C. (2007b). Introduction to Strong Mixing Conditions , Vol. 2. Kendrick Press, Heber City, UT.Google Scholar
Bradley, R. C. (2007c). Introduction to Strong Mixing Conditions , Vol. 3. Kendrick Press, Heber City, UT.Google Scholar
Burton, R. M., Goulet, M. and Meester, R. (1993). On 1-dependent processes and k-block factors. Ann. Prob. 21, 2157–2168.Google Scholar
Devroye, L. (1991). Limit laws for local counters in random binary search trees. Random Structures Algorithms 2, 303–315.Google Scholar
Devroye, L. (2002). Limit laws for sums of functions of subtrees of random binary search trees. SIAM J. Comput. 32, 152–171.Google Scholar
Diananda, P. H. (1955). The central limit theorem for m-dependent variables. Proc. Camb. Phil. Soc. 51, 92–95.CrossRefGoogle Scholar
Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edn. John Wiley, New York.Google Scholar
Hoeffding, W. and Robbins, H. (1948). The central limit theorem for dependent random variables. Duke Math. J. 15, 773–780.Google Scholar
Holmgren, C. and Janson, S. (2015). Limit laws for functions of fringe trees for binary search trees and random recursive trees. Electron. J. Prob. 20, 51 pp.Google Scholar
Holst, L. (1981). Some conditional limit theorems in exponential families. Ann. Prob. 9, 818–830.Google Scholar
Ibragimov, I. A. (1975). A note on the central limit theorems for dependent random variables. Theory Prob. Appl. 20, 135–141.Google Scholar
Ibragimov, I. A. and Linnik, Yu. V. (1971). Independent and Stationary Sequences of Random Variables. Wolters-Noordhoff, Groningen.Google Scholar
Janson, S. (2012). Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation. Prob. Surveys 9, 103–252.Google Scholar
Janson, S. (2014). Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Structures Algorithms 10.1002/rsa.20568.Google Scholar
Le Cam, L. (1958). Un théorème sur la division d'un intervalle par des points pris au hasard. Publ. Inst. Statist. Univ. Paris 7, 7–16.Google Scholar
Leonov, V. P. (1961). On the dispersion of time-dependent means of a stationary stochastic process. Theory Prob. Appl. 6, 87–93.Google Scholar
Robinson, E. A. (1960). Sums of stationary random variables. Proc. Amer. Math. Soc. 11, 77–79.CrossRefGoogle Scholar
Schmidt, K. (1977). Cocycles on Ergodic Transformation Groups (Macmillan Lectures Math. 1). Macmillan Company of India, Delhi.Google Scholar