Universal Codes as a Basis for Nonparametric Testing of Serial Independence for Time Series
Boris Ryabko, Jaakko Astola
Abstract
We consider a stationary and ergodic source p generated symbols x1 ... xt from some finite set A and a null hypothesis H0 that p is Markovian source with memory (or connectivity) not larger than m, (m >= 0). The alternative hypothesis H1 is that the sequence is generated by a stationary and ergodic source, which differs from the source under H0. In particular, if m= 0 we have the null hypothesis H0 that the sequence is generated by Bernoully source (or the hypothesis that x1 ...xt are independent.) Some new tests which are based on universal codes and universal predictors, are suggested.
Create a lesson
Related papers
Optimal Support Size Testing
Qisheng Wang
Dynamic Attack Surfaces: A Queue of Branching Processes
Ismail Cosandal, Abdullah Y. Etcibasi, C. Emre Koksal et al.
On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara et al.
Solomonoff induction of selected bits and online classification
Bruno Bauwens, German Kuznetsov
Rate-Splitting Multiple Access for RIS-Enabled Full-Duplex Communications with User Relaying
Yuwen Cao, Hui Wang, Tomoaki Ohtsuki et al.
Full classification of Zps-linear generalized Hadamard codes
Dipak K. Bhunia