Abstract.
Let {X n } be a stationary and ergodic time series taking values from a finite or countably infinite set Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times λ n along which we will be able to estimate the conditional probability P(=x|X0,...,) from data segment (X0,...,) in a pointwise consistent way for a restricted class of stationary and ergodic finite or countably infinite alphabet time series which includes among others all stationary and ergodic finitarily Markovian processes. If the stationary and ergodic process turns out to be finitarily Markovian (among others, all stationary and ergodic Markov chains are included in this class) then almost surely. If the stationary and ergodic process turns out to possess finite entropy rate then λ n is upperbounded by a polynomial, eventually almost surely.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bailey, D.H.: Sequential schemes for classifying and predicting ergodic processes. Ph.D. thesis, Stanford University, 1976
Chung, K.L.: A note on the ergodic theorem of information theory. Ann. Math. Stat. 32, 612–614 (1961)
Cover, T.M., Thomas, J.: Elements of information theory. Wiley, 1991
Csiszár, I., Shields, P.: The consistency of the BIC Markov order estimator. Ann. Stat. 28, 1601–1619 (2000)
Csiszár, I.: Large-scale typicality of Markov sample paths and consistency of MDL order estimators. IEEE Trans. Inf. Theory 48, 1616–1628 (2002)
Devroye, L., Györfi, L., Lugosi, G.: A probabilistic theory of pattern recognition. Springer-Verlag, New York, 1996
Györfi, L., Morvai, G., Yakowitz, S.: Limits to consistent on-line forecasting for ergodic time series. IEEE Trans. Inf. Theory 44, 886–892 (1998)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Association 58, 13–30 (1963)
Kalikow, S.: Random Markov processes and uniform martingales. Israel J. Math. 71, 33–54 (1990)
Keane, M.: Strongly mixing g-measures. Invent. Math. 16, 309–324 (1972)
Morvai, G.: Guessing the output of a stationary binary time series. In: Foundations of Statistical Inference, Y. Haitovsky, H.R.Lerche, Y. Ritov (eds.), Physika-Verlag, 2003, pp. 207–215
Morvai, G., Weiss, B.: Forecasting for stationary binary time series. Acta Applicandae Mathematicae 79, 25–34 (2003)
Révész, P.: The law of large numbers. Academic Press, 1968
Ryabko, Ya.B.: Prediction of random sequences and universal coding. Problems of Inform. Trans. 24, 87–96 (1988)
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (2000): 62G05, 60G25, 60G10
Rights and permissions
About this article
Cite this article
Morvai, G., Weiss, B. Prediction for discrete time series. Probab. Theory Relat. Fields 132, 1–12 (2005). https://doi.org/10.1007/s00440-004-0386-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-004-0386-3