Affordable Access

Limitations on intermittent forecasting



Bailey showed that the general pointwise forecasting for stationary and ergodic time series has a negative solution. However, it is known that for Markov chains the problem can be solved. Morvai showed that there is a stopping time sequence {[lambda]n} such that P(X[lambda]n+1=1X0,...,X[lambda]n) can be estimated from samples (X0,...,X[lambda]n) such that the difference between the conditional probability and the estimate vanishes along these stoppping times for all stationary and ergodic binary time series. We will show it is not possible to estimate the above conditional probability along a stopping time sequence for all stationary and ergodic binary time series in a pointwise sense such that if the time series turns out to be a Markov chain, the predictor will predict eventually for all n.

There are no comments yet on this publication. Be the first to share your thoughts.