Perfect simulation of infinite range Gibbs measures and coupling with their finite range approximations
classification
🧮 math.PR
math-phmath.MP
keywords
rangemeasurefiniteinfinitesamplingalgorithmapproximationsgibbs
read the original 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.
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.