Perfect simulation for interacting point processes, loss networks and Ising models

Abstract

We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birth-and-death processes. Examples include area- and perimeter-interacting point processes (with stochastic grains), invariant measures of loss networks, and the Ising contour and random cluster models. The algorithm does not involve couplings of the process with different initial conditions and it is not tied up to monotonicity requirements. Furthermore, it directly provides perfect samples of finite windows of the infinite-volume measure, subjected to time and space ``user-impatience bias''. The algorithm is based on a two-step procedure: (i) a perfect-simulation scheme for a (finite and random) relevant portion of a (space-time) marked Poisson processes (free birth-and-death process, free loss networks), and (ii) a ``cleaning'' algorithm that trims out this process according to the interaction rules of the target process. The first step involves the perfect generation of ``ancestors'' of a given object, that is of predecessors that may have an influence on the birth-rate under the target process. The second step, and hence the whole procedure, is feasible if these ``ancestors'' form a finite set with probability one. We present a sufficiency criteria for this condition, based on the absence of infinite clusters for an associated (backwards) oriented percolation model.

Revised version after referee of SPA: 39 pages

References in corpus (2)

• Processes with Long Memory: Regenerative Construction and Perfect Simulation
• The Randomness Recycler: A new technique for perfect sampling

Cited by in corpus (32)

• The Random-Cluster Model
• A Short History of Markov Chain Monte Carlo: Subjective Recollections from Incomplete Data
• Infinite systems of interacting chains with memory of variable length - a stochastic model for biological neural nets
• Spatial birth and death processes as solutions of stochastic equations
• Existence and spatial limit theorems for lattice and continuum particle systems
• Markovianity in space and time
• Moderate deviations for some point measures in geometric probability
• A stochastic system with infinite interacting components to model the time evolution of the membrane potentials of a population of neurons
• Decorrelation of a class of Gibbs particle processes and asymptotic properties of U-statistics
• The Evolution of a Spatial Stochastic Network
• Dobrushin-Kotecky-Shlosman theorem for polygonal Markov fields in the plane
• Non-homogeneous polygonal Markov fields in the plane: graphical representations and geometry of higher order correlations
• Perfect simulation and finitary coding for multicolor systems with interactions of infinite range
• On the uniqueness of Gibbs distributions with a non-negative and subcritical pair potential
• Kalikow-type decomposition for multicolor infinite range particle systems
• The Tightness of the Kesten-Stigum Reconstruction Bound of Symmetric Model with Multiple Mutations
• Revisiting Groeneveld's approach to the virial expansion
• Stability of a spatial polling system with greedy myopic service
• Stabilization and limit theorems for geometric functionals of Gibbs point processes
• A general framework for perfect simulation of long memory processes
• Sampling Point Processes on Stable Unbounded Regions and Exam Simulation of Queues
• The Jamming Constant of Uniform Random Graphs
• Stability of gas measures under perturbations and discretizations
• Spatial birth-and-death processes in random environment
• Hitting times for independent random walks on ${\mathbb{Z}}^d$
• Partially Recursive Acceptance Rejection
• Construction of the Thermodynamic Jamming Limit for the Parking Process and Other Exclusion Schemes on Z^d
• Perfect simulation for unilateral fields
• Coupling from the past times with ambiguities and perturbations of interacting particle systems
• Improved bounds for perfect simulation of a continuous one-dimensional loss network
• Designing Perfect Simulation Algorithms using Local Correctness
• Graphical Construction of Spatial Gibbs Random Graphs