Ergodicity of PCA
(2004)

For a general attractive Probabilistic Cellular Automata on S-Zd, we prove that the (time-) convergence towards equilibrium of this Markovian parallel dynamics, exponentially fast in the uniform norm, is equivalent to a condition (A). This condition means the exponential decay of the influence from the boundary for the invariant measures of the system restricted to finite boxes. For a class of reversible PCA dynamics on {1,+1}(Zd), wit a naturally associated Gibbsian potential rho, we prove that a (spatial-) weak mixing condition (WM) for rho implies the validity of the assumption (A); thus exponential (time-) ergodicity of these dynamics towards the unique Gibbs measure associated to rho hods. On some particular examples we state that exponential ergodicity holds as soon as there is no phase transition.

We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.

We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However, we show that there are partially ordered sets for which monotonicity and complete monotonicity coincide in continuous time but not in discrete-time.

We formalize and analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However, we show that there are partially ordered sets for which monotonicity and complete monotonicity coincide in continuoustime but not in discrete-time.

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.

We first introduce some coupling of a finite number of Probabilistic Cellular Automata dynamics (PCA), preserving the stochastic ordering. Using this tool, for a general attractive probabilistic cellular automata on SZd, where S is finite, we prove that a condition (A) is equivalent to the (time-) convergence towards equilibrium of this Markovian parallel dynamics, in the uniform norm, exponentially fast. This condition (A) means the exponential decay of the influence from the boundary for the invariant measures of the system restricted to finite ‘box’-volume. For a class of reversible PCA dynamics on {−1, +1}Zd , with a naturally associated Gibbsian potential ϕ, we prove that a Weak Mixing condition for ϕ implies the validity of the assumption (A); thus the ‘exponential ergodicity’ of the dynamics towards the unique Gibbs measure associated to ϕ holds. On some particular examples of this PCA class, we verify that our assumption (A) is weaker than the Dobrushin-Vasershtein ergodicity condition. For some special PCA, the ‘exponential ergodicity’ holds as soon as there is no phase transition.

We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However, we show that there are partially ordered sets for which monotonicity and complete monotonicity coincide in continuous time but not in discrete-time

We give a necessary and sufficient condition for the existence of an increasing coupling of N (N greater as 2) synchronous dynamics on S^Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.

For a general attractive Probabilistic Cellular Automata on SZd, we prove that the (time-) convergence towards equilibrium of this Markovian parallel dynamics exponentially fast in the uniform norm is equivalent to a condition (A). This condition means the exponential decay of the influence from the boundary for the invariant measures of the system restricted to finite boxes. For a class of reversible PCA dynamics on {;1, +1}Zd, with a naturally associated Gibbsian potential ;, we prove that a (spatial-) weak mixing condition (WM) for ; implies the validity of the assumption (A); thus exponential (time-) ergodicity of these dynamics towards the unique Gibbs measure associated to ; holds. On some particular examples we state that exponential ergodicity holds as soon as there is no phase transition.