On approximate pattern matching for a class of Gibbs random fields
Probability
2007-05-23 v3
Abstract
We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibssian sources on the lattice , . From this result, we deduce a law of large numbers and a large deviation result for the waiting time of distorted patterns.
Keywords
Cite
@article{arxiv.math/0503008,
title = {On approximate pattern matching for a class of Gibbs random fields},
author = {Jean-Rene Chazottes and Frank Redig and Evgeny Verbitskiy},
journal= {arXiv preprint arXiv:math/0503008},
year = {2007}
}
Comments
Published at http://dx.doi.org/10.1214/105051605000000827 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)