Phase transition between synchronous and asynchronous updating algorithms (Q2468267)

The authors study the phase transition between synchronous and asynchronous updating a one-dimensional chain of Ising model of length \(L\) with algorithms which are parameterized by the probability \(p\) for a certain site to get updated in one time step. They show that the result of the update event itself is determined by the energy change due to the local change in the configuration. For \(p\) of the order of \(1/L\) and for sufficiently large values of \(L\) they interpolate between the Metropolis algorithm at zero temperature and a synchronous deterministic updating procedure for \(p = 1\). It is observed that a phase transition occurs between the stationary states to which the algorithm drives the system by means of a function of \(p\). Non-absorbing stationary states with antiferromagnetic domains for \(p > p_{c}\) (where \(p_{c}\) is the critical point), and absorbing states with ferromagnetic domains for \(p \leq p_{c}\) is studied. By analyzing the critical exponents \(\delta, \beta, \upsilon_{\perp}, \upsilon_{| | }, \eta \) and \(\gamma\) the authors point out that these exponents are consistent with the ones conjectured for the parity conservation (PC) universality class.