Garcia, N. L. and Moreira, L.
In this paper, we study inference for chains of variable order under two distinct contamination regimes. Consider a chain of variable memory on a ﬁnite alphabet containing zero, at each instant of time an independent coin is ﬂipped and if it turns head a contamination occurs. In the ﬁrst regime a zero is read independently of the value of the chain. In the second regime, the chain chooses the law of another chain of variable memory to generate the observation instead of the original one. Our results state that the diﬀerence between the transition probabilities of the original process and the corresponding ones of the contaminated process may be bounded above uniformly. Moreover, if the contamination probability is small enough, using a version of the Context algorithm we are able to recover the context tree of the original process through a contaminated sample.
The whole paper is available here.Share on Twitter Share on Facebook
Featuring this week:
Stay informed on our latest news!
|Follow Us on Facebook|