Abstract
In this paper we address the questions of perfectly sampling a Gibbs measure with infinite range interactions and of perfectly sampling the measure together with its finite range approximations. We solve these questions by introducing a perfect simulation algorithm for the measure and for the coupled measures. The algorithm works for general Gibbsian interaction under requirements on the tails of the interaction. As a consequence we obtain an upper bound for the error we make when sampling from a finite range approximation instead of the true infinite range measure.
| Original language | English |
|---|---|
| Pages (from-to) | 476-495 |
| Number of pages | 20 |
| Journal | Journal of Statistical Physics |
| Volume | 138 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2010 |
| Externally published | Yes |
Keywords
- Coupling
- Finite range approximations
- Gibbs measure
- Infinite range interactions
- Interacting particle systems
- Perfect simulation
- d̄-distance
Fingerprint
Dive into the research topics of 'Perfect simulation of infinite range gibbs measures and coupling with their finite range approximations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver