On approximate pattern matching for a class of Gibbs random fields

dc.creatorChazottes, Jean-Rene
dc.creatorRedig, Frank
dc.creatorVerbitskiy, Evgeny
dc.date2005-03-01
dc.date2006-07-12
dc.date.accessioned2026-07-07T06:39:30Z
dc.date.available2026-07-07T06:39:30Z
dc.descriptionWe 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.
dc.descriptionPublished 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)
dc.identifierhttps://arxiv.org/abs/math/0503008
dc.identifierhttp://arxiv.org/abs/math/0503008
dc.identifierAnnals of Applied Probability 2006, Vol. 16, No. 2, 670-684
dc.identifierdoi:10.1214/105051605000000827
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101101
dc.subjectProbability
dc.subject60G60 (Primary) 60F05, 60F10, 94A08, 94A34 (Secondary)
dc.titleOn approximate pattern matching for a class of Gibbs random fields
dc.typetext

Files

Collections