Random perturbations of stochastic processes with unbounded variable length memory
Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
---|---|
Data(s) |
19/04/2012
19/04/2012
2008
|
Resumo |
We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the transition probabilities of the perturbed chain are uniformly close to the corresponding transition probabilities of the original chain. As a consequence, in the case of stochastic chains with unbounded but otherwise finite variable length memory, we show that it is possible to recover the context tree of the original chain, using a suitable version of the algorithm Context, provided that the noise is small enough. PRONEX /FAPESP's[03/09930-9] Centre National de la Recherche Scientifique - CNRS-FAPESP CNPq's[475177/2004-5] CNPq's[308656/2005-9] Rhythmic patterns, prosodic domains and probabilistic modeling in Portuguese Corpora[485999/2007-2] FAPESP[06/56980-0] |
Identificador |
ELECTRONIC JOURNAL OF PROBABILITY, v.13, p.1345-1361, 2008 1083-6489 http://producao.usp.br/handle/BDPI/16672 http://128.208.128.142/~ejpecp/include/getdoc.php?id=4585&article=1835&mode=pdf |
Idioma(s) |
eng |
Publicador |
UNIV WASHINGTON, DEPT MATHEMATICS |
Relação |
Electronic Journal of Probability |
Direitos |
openAccess Copyright UNIV WASHINGTON, DEPT MATHEMATICS |
Palavras-Chave | #chains of infinite order #variable length Markov chains #chains with unbounded variable length memory #random perturbations #algorithm Context #context trees #MARKOV-CHAINS #Statistics & Probability |
Tipo |
article original article publishedVersion |