We consider a particle system on Zd 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 ¯ d-distance for two ordered Ising probability measures.
Galves, A., Garcia N., L., Locherbach, E., Orlandi, V. (2013). Kalikov - type decomposition for multicolor infinite range particle systems. THE ANNALS OF APPLIED PROBABILITY, 23(4), 1629-1659 [1659 DOI: 10.1214/12].
Kalikov - type decomposition for multicolor infinite range particle systems
ORLANDI, Vincenza
2013-01-01
Abstract
We consider a particle system on Zd 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 ¯ d-distance for two ordered Ising probability measures.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.