Extensions of fill's algorithm for perfect simulation

13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Fill's algorithm for perfect simulation for attractive finite state space models, unbiased for user impatience, is presented in terms of stochastic recursive sequences and extended in two ways. Repulsive discrete Markov random fields with two coding sets like the auto-Poisson distribution on a lattice with 4-neighbourhood can be treated as monotone systems if a particular partial ordering and quasi-maximal and quasi-minimal states are used. Fill's algorithm then applies directly. Combining Fill's rejection sampling with sandwiching leads to a version of the algorithm which works for general discrete conditionally specified repulsive models. Extensions to other types of models are briefly discussed.

Cite

CITATION STYLE

APA

Møller, J., & Schladitz, K. (1999). Extensions of fill’s algorithm for perfect simulation. Journal of the Royal Statistical Society. Series B: Statistical Methodology, 61(4), 955–969. https://doi.org/10.1111/1467-9868.00213

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free