Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
From MaRDI portal
Publication:4521482
DOI10.1239/aap/1013540247zbMath1123.60309OpenAlexW2033229837MaRDI QIDQ4521482
Wilfrid S. Kendall, Jesper Møller
Publication date: 19 December 2000
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aap/1013540247
Markov chain Monte Carlolocal stabilityStrauss processMetropolis-Hastingsspatial point processperfect simulationexact simulationstochastic monotonicityspatial birth-and-death processrealizable monotonicityPapangelou conditional intensitycoupling from the past (CFTP)dominated CFTP
Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (57)
A perfect sampling method for exponential family random graph models ⋮ Bayesian analysis of a Gibbs hard-core point pattern model with varying repulsion range ⋮ A Spectral Independence View on Hard Spheres via Block Dynamics ⋮ Boundedness conditions for relative error in fast simulation of reliability of non-Markovian systems ⋮ On the simulation of Markov chain steady-state distribution using CFTP algorithm ⋮ A functional central limit theorem for the empirical Ripley's \(K\)-function ⋮ Strong spatial mixing for repulsive point processes ⋮ A Guide to Exact Simulation ⋮ Kalikow-type decomposition for multicolor infinite range particle systems ⋮ Fast perfect simulation of Vervaat perpetuities ⋮ MCMC Computations for Bayesian Mixture Models Using Repulsive Point Processes ⋮ Perfect sampling for Gibbs point processes using partial rejection sampling ⋮ State estimation for aoristic models ⋮ Determinantal Point Processes ⋮ Perfect Simulation for Length‐interacting Polygonal Markov Fields in the Plane ⋮ Generating From the Strauss Process Using Stitching ⋮ Unnamed Item ⋮ Power diagrams and interaction processes for unions of discs ⋮ A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data ⋮ Probability and algorithmics: a focus on some recent developments ⋮ Slice sampling. (With discussions and rejoinder) ⋮ Spatial birth-death swap chains ⋮ Computational issues for perfect simulation in spatial point patterns. ⋮ Perfect simulation of Hawkes processes ⋮ Reversible Markov processes on general spaces and spatial migration processes ⋮ Perfect simulation for a class of positive recurrent Markov chains ⋮ Exact simulation for discrete time spin systems and unilateral fields ⋮ Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations ⋮ Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models ⋮ Nonparametric indices of dependence between components for inhomogeneous multivariate random measures and marked sets ⋮ Bayesian inference for spatially inhomogeneous pairwise interacting point processes ⋮ Exact Monte Carlo simulation for fork-join networks ⋮ Bounds for the Probability Generating Functional of a Gibbs Point Process ⋮ Thinning spatial point processes into Poisson processes ⋮ Gibbs point processes for studying the development of spatial-temporal stochastic processes. ⋮ Generalised shot noise Cox processes ⋮ Perfect simulation and inference for point processes given noisy observations ⋮ Perfect simulation of M/G/c queues ⋮ Doeblin trees ⋮ Perfect simulation of the hard disks model by partial rejection sampling ⋮ Exact simulation of the extrema of stable processes ⋮ Exact sampling for some multi-dimensional queueing models with renewal input ⋮ A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability ⋮ NON-PARAMETRIC BAYESIAN INFERENCE FOR INHOMOGENEOUS MARKOV POINT PROCESSES ⋮ Perfect simulation for marked point processes ⋮ Modelling Aggregation on the Large Scale and Regularity on the Small Scale in Spatial Point Pattern Datasets ⋮ Likelihood and Non‐parametric Bayesian MCMC Inference for Spatial Point Processes Based on Perfect Simulation and Path Sampling ⋮ Perfect sampling of GI/GI/\(c\) queues ⋮ The Candy model: properties and inference ⋮ Simulation study for the clan of ancestors in a perfect simulation scheme of a continuous one-dimensional loss network ⋮ Finitary codings for spatial mixing Markov random fields ⋮ Simulated annealing and object point processes: Tools for analysis of spatial patterns ⋮ Perfect simulation for interacting point processes, loss networks and Ising models. ⋮ Perfect and nearly perfect sampling of work-conserving queues ⋮ Perfect sampling of Jackson queueing networks ⋮ Perfect sampling of a single-server queue with periodic Poisson arrivals ⋮ Transforming Spatial Point Processes into Poisson Processes Using Random Superposition
This page was built for publication: Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
