Kalikow-type decomposition for multicolor infinite range particle systems
A. Galves, N. L. Garcia, E. L\"ocherbach, E. Orlandi

TL;DR
This paper introduces a Kalikow-type decomposition for infinite-range particle systems with continuous change rates, enabling perfect simulation and explicit coupling construction under high noise conditions.
Contribution
It provides a novel decomposition method for infinite-range interactions and develops a perfect simulation algorithm for stationary distributions.
Findings
Decomposition of infinite-range rates into finite-range mixtures
Feasible perfect simulation algorithm under high noise
Explicit coupling construction for Ornstein's ar-distance
Abstract
We consider a particle system on 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 -distance for two ordered Ising probability measures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
