Phase transition between synchronous and asynchronous updating algorithms

Physics – Condensed Matter – Other Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 3 figures

Scientific paper

10.1007/s10955-007-9416-8

We update a one-dimensional chain of Ising spins of length $L$ with algorithms which are parameterized by the probability $p$ for a certain site to get updated in one time step. The result of the update event itself is determined by the energy change due to the local change in the configuration. In this way we interpolate between the Metropolis algorithm at zero temperature for $p$ of the order of 1/L and for large $L$, and a synchronous deterministic updating procedure for $p=1$. As function of $p$ we observe a phase transition between the stationary states to which the algorithm drives the system. These are non-absorbing stationary states with antiferromagnetic domains for $p>p_c$, and absorbing states with ferromagnetic domains for $p\leq p_c$. This means that above this transition the stationary states have lost any remnants to the ferromagnetic Ising interaction. A measurement of the critical exponents shows that this transition belongs to the universality class of parity conservation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Phase transition between synchronous and asynchronous updating algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Phase transition between synchronous and asynchronous updating algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phase transition between synchronous and asynchronous updating algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-338420

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.