|
|
|
[Contents] | [Index] |
Cooperation with: P. Dai Pra (Università degli Studi di Padova, Italy), P.-Y. Louis (Université Lille 1, France)
Description:
Probabilistic Cellular Automata (PCAs) are discrete time Markov chains with parallel updating and local updating rules ([1]). PCAs are natural stochastic algorithms for parallel computing and as such have become widely used numerical tools in a large number of fields.
A key question in the theory of PCAs concerns the classification of
their invariant measures according to their nature as stationary, reversible, or
Gibbsian measures. This question was addressed in [2]
for general PCAs, and
the results were illustrated in the context of a class of reversible PCAs
that were introduced by Lebowitz, Maes, and Speer ([4]).
In fact, it has been known for a long time ([3]) that if a PCA is reversible with
respect to a Gibbs measure corresponding to a potential ,
then all its reversible measures are Gibbsian with respect to the same
potential. In [2], a similar statement is now proven for the set of stationary
measures:
For a general PCA, if one shift invariant
stationary measure is
Gibbsian for a potential , then all shift invariant
stationary measures are Gibbsian
w.r.t. the same potential
.This induces that for a class of local, shift invariant, non-degenerated,
reversible PCAs the reversible measures coincide with the Gibbsian
stationary ones.
Applying this general statements to a particular class of reversible
PCAs, it is shown in [2], using contour arguments that, for sufficiently
small values of the temperature parameter, phase transition occurs,
that is there are several Gibbs
measures w.r.t. .
Furthermore, unlike what happens with sequential updating, a Gibbs
measure which is not stationary for
the associated PCA is exhibited.
References:
|
|
|
[Contents] | [Index] |