Computational issues for perfect simulation in spatial point patterns.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1188967 (Why is no real title available?)
- scientific article; zbMATH DE number 1302140 (Why is no real title available?)
- A model for clustering
- A primer on perfect simulation for spatial point processes
- An interruptible algorithm for perfect sampling via Markov chains
- Area-interaction point processes
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to couple from the past using a read-once source of randomness
- Perfect simulation and backward coupling∗
- Perfect simulation for interacting point processes, loss networks and Ising models.
- Perfect simulation of some point processes for the impatient user
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
Cited in
(6)- A primer on perfect simulation for spatial point processes
- The conditional Boolean model revisited
- Perfect simulation and inference for point processes given noisy observations
- Spatial birth-death swap chains
- scientific article; zbMATH DE number 1385370 (Why is no real title available?)
- Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001
This page was built for publication: Computational issues for perfect simulation in spatial point patterns.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1421552)