On approximate pattern matching for a class of Gibbs random fields
classification
🧮 math.PR
keywords
approximateclasslargepatternsresultapproximationdeducedeviation
read the original abstract
We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibssian sources on the lattice $\mathbb{Z}^d$, $d\ge2$. From this result, we deduce a law of large numbers and a large deviation result for the waiting time of distorted patterns.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.