A primer on perfect simulation for spatial point processes
From MaRDI portal
The paper gives a survey of Markov chain Monte Carlo methods for the perfect simulation of samples from locally stable finite point processes. In particular, the dominated coupling from the past, coupling from the past based on sandwiching between upper and lower processes and on the clan of ancestors are considered. Examples of the Strauss process and the area interaction point process are given. Finally, the empirical comparison of the algorithms is provided.
Recommendations
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- Computational issues for perfect simulation in spatial point patterns.
- scientific article; zbMATH DE number 1385370
- Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001
- scientific article; zbMATH DE number 1302140
Cited in
(30)- Perfect simulation for marked point processes
- Simulation study for the clan of ancestors in a perfect simulation scheme of a continuous one-dimensional loss network
- Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes
- Computational issues for perfect simulation in spatial point patterns.
- Perfect simulation and inference for point processes given noisy observations
- Fast approximation of the intensity of Gibbs point processes
- Bounds on the artificial phase transition for perfect simulation of hard core Gibbs processes
- Perfect sampling for Gibbs point processes using partial rejection sampling
- Perfect simulation for interacting point processes, loss networks and Ising models.
- The conditional Boolean model revisited
- Perfect simulation of spatial processes. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001
- Perfect simulation of spatial processes.
- Fast covariance estimation for innovations computed from a spatial Gibbs point process
- Transforming spatial point processes into Poisson processes using random superposition
- Perfect simulation using dominated coupling from the past with application to area-interaction point processes and wavelet thresholding
- Notes on perfect simulation
- Perfect Simulation for Length‐interacting Polygonal Markov Fields in the Plane
- Thinning spatial point processes into Poisson processes
- scientific article; zbMATH DE number 1188967 (Why is no real title available?)
- scientific article; zbMATH DE number 1302140 (Why is no real title available?)
- Spatial birth-death swap chains
- Likelihood and Non‐parametric Bayesian MCMC Inference for Spatial Point Processes Based on Perfect Simulation and Path Sampling
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- scientific article; zbMATH DE number 1385370 (Why is no real title available?)
- Double Happiness: Enhancing the Coupled Gains of L-lag Coupling via Control Variates
- A BIRTH AND DEATH PROCESS FOR BAYESIAN NETWORK STRUCTURE INFERENCE
- Bias correction for parameter estimates of spatial point process models
- Adjusted composite likelihood ratio test for spatial Gibbs point processes
- Generating From the Strauss Process Using Stitching
- Approximating the moments of a spatial point process
This page was built for publication: A primer on perfect simulation for spatial point processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1416108)
