Refine
Has Fulltext
- yes (4) (remove)
Document Type
- Preprint (4) (remove)
Keywords
- Probabilistic Cellular Automata (2)
- Attractive Dynamics (1)
- Coupling (1)
- Interacting Particle Systems (1)
- Markov processes (1)
- Stochastic Ordering (1)
- Weak Mixing Condition (1)
- coupling (1)
- dynamical system representation (1)
- monotone coupling (1)
- monotone random (1)
- monotonicity conditions (1)
- partial ordering (1)
- stochastic ordering (1)
Institute
- Institut für Mathematik (4)
- Extern (1)
Studying the influence of the updating scheme for MCMC algorithm on spatially extended models is a well known problem. For discrete-time interacting particle systems we study through simulations the effectiveness of a synchronous updating scheme versus the usual sequential one. We compare the speed of convergence of the associated Markov chains from the point of view of the time-to-coalescence arising in the coupling-from-the-past algorithm. Unlike the intuition, the synchronous updating scheme is not always the best one. The distribution of the time-to-coalescence for these spatially extended models is studied too.