On approximate pattern matching for a class of Gibbs random fields
Jean-Rene Chazottes, Frank Redig, Evgeny Verbitskiy
Abstract
We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibssian sources on the lattice Zd, d2. From this result, we deduce a law of large numbers and a large deviation result for the waiting time of distorted patterns.
Create a lesson
Related papers
Distribution-constrained optimal multiple stopping: the Root-type solution
Shuoqing Deng, Daxin Huang
Universality and sharp thresholds for ellipsoid fitting
Frederic Koehler, Youngtak Sohn
Local Laws and Edge Universality for Noncentral Sample Covariance Matrices
Can Hu, Jiang Hu, Zhidong Bai
Well-posedness and regularity of stochastic heat equations on moving domains
Chongyang Ren, Tusheng Zhang
Traveling Waves in Equity Markets with Rank-Based Entry and Exit
Graeme Baker, Caroline Smyth
An approximate zero bias transformation for random sums: Applications to sampling with outliers, auto insurance, and generative AI
Wasamon Jantai, Nathakhun Wiroonsri