@article{Louis2004, author = {Louis, Pierre-Yves}, title = {Ergodicity of PCA: equivalence between spatial and temporal mixing conditions}, year = {2004}, abstract = {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.}, language = {en} } @article{Louis2005, author = {Louis, Pierre-Yves}, title = {Increasing coupling for probabilistic cellular automata}, year = {2005}, abstract = {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.}, language = {en} } @article{DaiPraLouisMinelli2006, author = {Dai Pra, Paolo and Louis, Pierre-Yves and Minelli, Ida}, title = {Monotonicity and complete monotonicity for continuous-time Markov chains}, issn = {1631-073X}, doi = {10.1016/j.crma.2006.04.007}, year = {2006}, abstract = {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}, language = {en} }