Kalikow-type decomposition for multicolor infinite range particle systems

Abstract

We consider a particle system on ${\mathbb{Z}}^d$ with real state space and interactions of infinite range. Assuming that the rate of change is continuous we obtain a Kalikow-type decomposition of the infinite range change rates as a mixture of finite range change rates. Furthermore, if a high noise condition holds, as an application of this decomposition, we design a feasible perfect simulation algorithm to sample from the stationary process. Finally, the perfect simulation scheme allows us to forge an algorithm to obtain an explicit construction of a coupling attaining Ornstein's $\bar{d}$-distance for two ordered Ising probability measures.

Published in at http://dx.doi.org/10.1214/12-AAP882 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (6)

• Perfect simulation for a class of positive recurrent Markov chains
• Perfect simulation of infinite range Gibbs measures and coupling with their finite range approximations
• How Gibbs distributions may naturally arise from synaptic adaptation mechanisms. A model-based argumentation
• No phase transition for Gaussian fields with bounded spins
• Perfect simulation of a coupling achieving the $\bar{d}$-distance between ordered pairs of binary chains of infinite order
• Spike trains statistics in Integrate and Fire Models: exact results

Cited by in corpus (2)

• Infinite systems of interacting chains with memory of variable length - a stochastic model for biological neural nets
• A stochastic system with infinite interacting components to model the time evolution of the membrane potentials of a population of neurons