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

DOI10.1016/S0304-4149(02)00180-1zbMath1075.60583arXivmath/9911162WikidataQ98382961 ScholiaQ98382961MaRDI QIDQ2574519

Pablo A. Ferrari, Roberto Fernández, Nancy L. Garcia

Publication date: 29 November 2005

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9911162

zbMATH Keywords

Monte Carlo methods

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (40)

The jamming constant of uniform random graphs ⋮ Graphical construction of spatial Gibbs random graphs ⋮ Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory ⋮ A stochastic system with infinite interacting components to model the time evolution of the membrane potentials of a population of neurons ⋮ Hitting times for independent random walks on \(\mathbb Z^d\) ⋮ A functional central limit theorem for the empirical Ripley's \(K\)-function ⋮ Existence and perfect simulation of one-dimensional loss networks ⋮ Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets ⋮ Kalikow-type decomposition for multicolor infinite range particle systems ⋮ Perfect sampling for Gibbs point processes using partial rejection sampling ⋮ Limit theorems for geometric functionals of Gibbs point processes ⋮ On the uniqueness of Gibbs distributions with a non-negative and subcritical pair potential ⋮ Perfect Simulation for Length‐interacting Polygonal Markov Fields in the Plane ⋮ Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs ⋮ Convergence rate for geometric statistics of point processes having fast decay of dependence ⋮ A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data ⋮ Computational issues for perfect simulation in spatial point patterns. ⋮ Decorrelation of a class of Gibbs particle processes and asymptotic properties of U-statistics ⋮ Dynamic aspects of the flip-annihilation process ⋮ A hard-core stochastic process with simultaneous births and deaths ⋮ Exact simulation for discrete time spin systems and unilateral fields ⋮ Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models ⋮ The tightness of the Kesten-Stigum reconstruction bound of symmetric model with multiple mutations ⋮ Non-homogeneous polygonal Markov fields in the plane: graphical representations and geometry of higher order correlations ⋮ Thinning spatial point processes into Poisson processes ⋮ Stability of a spatial polling system with greedy myopic service ⋮ Variable-length analog of Stavskaya process: A new example of misleading simulation ⋮ Exponential rates of convergence in the ergodic theorem: a constructive approach ⋮ Construction of the thermodynamic jamming limit for the parking process and other exclusion schemes on \(\mathbb Z^d\) ⋮ The evolution of a spatial stochastic network ⋮ Normal approximation for statistics of Gibbsian input in geometric probability ⋮ Perfect simulation of M/G/c queues ⋮ Dobrushin-Kotecký-Shlosman theorem for polygonal Markov fields in the plane ⋮ Moderate deviations for some point measures in geometric probability ⋮ Perfect simulation for marked point processes ⋮ Random dynamics and thermodynamic limits for polygonal Markov fields in the plane ⋮ Mixture formulae for shot noise weighted point processes ⋮ Simulation study for the clan of ancestors in a perfect simulation scheme of a continuous one-dimensional loss network ⋮ Revisiting Groeneveld’s approach to the virial expansion ⋮ Transforming Spatial Point Processes into Poisson Processes Using Random Superposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ergodicity for spin systems with stirrings
• Cluster expansion for abstract polymer models
• Loss networks
• An interruptible algorithm for perfect sampling via Markov chains
• Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes
• Disagreement percolation in the study of Markov fields
• On the existence and nonexistence of finitary codings for a class of random fields
• A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet
• Loss network representation of Peierls contours
• Processes with long memory: Regenerative construction and perfect simulation
• Perfect sampling of ergodic Harris chains
• Area-interaction point processes
• The stochastic random-cluster process and the uniqueness of random-cluster measures
• Cluster expansion for \(d\)-dimensional lattice systems and finite-volume factorization properties.
• Propp–Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields
• A model for clustering
• A note on Strauss's model for clustering
• One-dimensional loss networks and conditioned M/G/∞ queues
• Perfect simulation of some point processes for the impatient user
• Perfect simulation and backward coupling^∗
• Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
• Exact sampling with coupled Markov chains and applications to statistical mechanics

This page was built for publication: Perfect simulation for interacting point processes, loss networks and Ising models.