On approximate pattern matching for a class of Gibbs random fields
DOI10.1214/105051605000000827zbMATH Open1131.60046arXivmath/0503008OpenAlexW2886799933MaRDI QIDQ997946FDOQ997946
Authors: Evgeny Verbitskiy, Jean-René Chazottes, F. Redig
Publication date: 8 August 2007
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503008
Recommendations
- Stochastic approximation algorithms for partition function estimation of Gibbs random fields
- An efficient estimator for Gibbs random fields
- On Gibbsianness of random fields
- Gibbsian random fields. The general case
- scientific article; zbMATH DE number 1208108
- Approximating Hidden Gaussian Markov Random Fields
- Approximate Bayes model selection procedures for Gibbs-Markov random fields
- scientific article
Large deviations (60F10) Random fields (60G60) Central limit and other weak theorems (60F05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Rate-distortion theory in information and communication theory (94A34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gibbs measures and phase transitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern matching and lossy data compression on random fields
- Source coding, large deviations, and approximate pattern matching
- Exponential distribution for the occurrence of rare patterns in Gibbsian random fields
- A suboptimal lossy data compression based on approximate pattern matching
- The asymptotics of waiting times between stationary processes, allowing distortion
Cited In (3)
This page was built for publication: On approximate pattern matching for a class of Gibbs random fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997946)