2009
DOI: 10.1007/s10955-009-9881-3
|View full text |Cite
|
Sign up to set email alerts
|

Perfect Simulation of Infinite Range Gibbs Measures and Coupling with Their Finite Range Approximations

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 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
46
0
2

Year Published

2012
2012
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(48 citation statements)
references
References 9 publications
0
46
0
2
Order By: Relevance
“…Note that in literature more general definitions of interactions are considered but in our paper we will only use this more restrictive definition, as done also in [3]. For brevity of notation set χ B (σ ) = v∈B σ (v) for any B Z d and σ ∈ S. A probability measure π on (S, S) is said to be a Gibbs measure relative to the interaction J ∈ J if for all v ∈ Z d and for any ζ ∈ S π σ (v) = ζ(v)|σ (u) = ζ(u) ∀u = v = 1 1 + exp(−2 B: v∈B (J B χ B (σ ))) a.s. (2) which are called local specifications.…”
Section: Synopsismentioning
confidence: 99%
See 1 more Smart Citation
“…Note that in literature more general definitions of interactions are considered but in our paper we will only use this more restrictive definition, as done also in [3]. For brevity of notation set χ B (σ ) = v∈B σ (v) for any B Z d and σ ∈ S. A probability measure π on (S, S) is said to be a Gibbs measure relative to the interaction J ∈ J if for all v ∈ Z d and for any ζ ∈ S π σ (v) = ζ(v)|σ (u) = ζ(u) ∀u = v = 1 1 + exp(−2 B: v∈B (J B χ B (σ ))) a.s. (2) which are called local specifications.…”
Section: Synopsismentioning
confidence: 99%
“…Now in [3] there is a construction of an auxiliary process that links the Glauber dynamics with the perfect sampling algorithm through decomposition (7).…”
Section: Proposition 1 Under Condition (1) the Following Decompositimentioning
confidence: 99%
“…One area of research concerns the Markov fields (see [3,12]); a second one concerns the processes with infinite memory (see [1,4,5,7]). Recently, these two areas of research have been in some sense unified by studying Gibbs measures with infinite interaction range (see [2,8]). Our paper is included in the latter context.…”
mentioning
confidence: 99%
“…Baseado no procedimento rascunho para trás, Galves et al (2010) abordaram o problema da simulação perfeita para a medida de Gibbs com interações de alcance infinito. Em , eles consideram um sistema de partícula em Z d com espaço de estados em R e interações de alcance infinito.…”
Section: Simulação Perfeitaunclassified