Guessing the output of a stationary binary time series
| dc.creator | Morvai, Gusztav | |
| dc.date | 2007-10-19 | |
| dc.date.accessioned | 2026-07-07T09:45:11Z | |
| dc.date.available | 2026-07-07T09:45:11Z | |
| dc.description | The forward prediction problem for a binary time series $\{X_n\}_{n=0}^{\infty}$ is to estimate the probability that $X_{n+1}=1$ based on the observations $X_i$, $0\le i\le n$ without prior knowledge of the distribution of the process $\{X_n\}$. It is known that this is not possible if one estimates at all values of $n$. We present a simple procedure which will attempt to make such a prediction infinitely often at carefully selected stopping times chosen by the algorithm. The growth rate of the stopping times is also exhibited. | |
| dc.identifier | https://arxiv.org/abs/0710.3760 | |
| dc.identifier | http://arxiv.org/abs/0710.3760 | |
| dc.identifier | Foundations of statistical inference (Shoresh, 2000), 207--215, Contrib. Statist., Physica, Heidelberg, 2003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163116 | |
| dc.subject | Probability | |
| dc.subject | Information Theory | |
| dc.title | Guessing the output of a stationary binary time series | |
| dc.type | text |