Extensions of Fill's Algorithm for Perfect Simulation

DOI10.1111/1467-9868.00213MaRDI QIDQ4935295zbMATH OpenOpenAlexFDO

Authors Katja Schladitz, Jesper Møller

Publication date 13 November 2001

Published in Journal of the Royal Statistical Society Series B: Statistical Methodology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1467-9868.00213

zbMATH Keywords

Fill's algorithmMarkov chain Monte Carloperfect simulation

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)

Recommendations

• scientific article; zbMATH DE number 1545677
• scientific article; zbMATH DE number 1560248
• Catalytic perfect simulation
• Perfect simulation of some point processes for the impatient user
• Perfect simulation

Cited in

(9)

• Perfect simulation for a stationary silo with absorbing walls
• Shift and scale coupling methods for perfect simulation
• Perfect simulation
• scientific article; zbMATH DE number 5017183 (Why is no real title available?)
• Perfect simulation of some point processes for the impatient user
• scientific article; zbMATH DE number 1545677 (Why is no real title available?)
• scientific article; zbMATH DE number 1560248 (Why is no real title available?)
• A Guide to Exact Simulation
• How to couple from the past using a read-once source of randomness

This page was built for publication: Extensions of Fill's Algorithm for Perfect Simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935295)