English

Universal Codes as a Basis for Nonparametric Testing of Serial Independence for Time Series

Information Theory 2007-07-13 v1 math.IT

Abstract

We consider a stationary and ergodic source pp generated symbols x1...xtx_1 ... x_t from some finite set AA and a null hypothesis H0H_0 that pp is Markovian source with memory (or connectivity) not larger than m,(m>=0).m, (m >= 0). The alternative hypothesis H1H_1 is that the sequence is generated by a stationary and ergodic source, which differs from the source under H0H_0. In particular, if m=0m= 0 we have the null hypothesis H0H_0 that the sequence is generated by Bernoully source (or the hypothesis that x1...xtx_1 ...x_t are independent.) Some new tests which are based on universal codes and universal predictors, are suggested.

Cite

@article{arxiv.cs/0506094,
  title  = {Universal Codes as a Basis for Nonparametric Testing of Serial Independence for Time Series},
  author = {Boris Ryabko and Jaakko Astola},
  journal= {arXiv preprint arXiv:cs/0506094},
  year   = {2007}
}

Comments

accepted for ISIT'05

R2 v1 2026-07-22T12:23:49.550Z