Douglas AshtonThree Ising model configurations each with 2^34 spins. All are close to the critical point and all look critical. As we zoom out we block more and more spins into each pixel and the configurations just off the critical point flow away to the fixed point phases.
The Renormalisation GroupDouglas Ashton2012-04-23 | Three Ising model configurations each with 2^34 spins. All are close to the critical point and all look critical. As we zoom out we block more and more spins into each pixel and the configurations just off the critical point flow away to the fixed point phases.
Video free to use under Creative Commons, just give a link to this channel youtube.com/alsodugLock and key chaining. h=0.7, eta=0.094Douglas Ashton2013-09-12 | Movie of Figure 1 from the paper http://pubs.rsc.org/en/Content/Articl... for more information. Last arXiv (free) version http://arxiv.org/abs/1304.3675Lock and key chaining. h=0.3, eta=0.14Douglas Ashton2013-09-11 | Movie of Figure 4b from the paper http://pubs.rsc.org/en/Content/ArticleLanding/2013/SM/c3sm51839f for more information. Last arXiv (free) version http://arxiv.org/abs/1304.3675Lock and key chaining. h=0.5, eta=0.105Douglas Ashton2013-09-11 | Movie of Figure 4a from the paper http://pubs.rsc.org/en/Content/ArticleLanding/2013/SM/c3sm51839f for more information. Last arXiv (free) version http://arxiv.org/abs/1304.3675Universality at the critical pointDouglas Ashton2011-07-08 | On the left is an Ising model for a magnet on a square lattice. On the right is a 2D Lennard-Jones fluid. Both are at their critical points. At a small scale the systems are very different but when we zoom out they look, statistically, the same. The scale of the last frame is 1024 spins on the left and 1,000 particle diameters across on the right.
A snapshot from a 2D Ising model at the critical point. The simulation used the Wolff algorithm on 2^34 (~10^10) lattice sites. The resulting system has clusters of every size such that all sense of scale is lost.Staged Insertion Grand Canonical Monte CarloDouglas Ashton2010-07-02 | A 2D Demonstration of how the staged insertion grand canonical algorithm works. Instead of inserting a particle in one go we make transitions between different "ghost levels". The stronger the colour the more the large particle interacts with its surroundings. The bar on the right shows which level we are on, the simulation random walks up and down this line.GCA in Restricted Gibbs EnsembleDouglas Ashton2010-07-01 | Animation of the geometric cluster algorithm operating in the restricted Gibbs ensemble. By swapping particles between two boxes we can study phase separation. The cluster moves themselves are the same as the canonical version.
Phys. Rev. Lett. 97, 115705 (2006)Geometric Cluster AlgorithmDouglas Ashton2010-07-01 | Animation of the canonical version of the geometric cluster algorithm. When a particle moves anything affected by the move is added with probability that reflects how strongly bonded it was before, or how strongly repelled it is afterwards.
Phys. Rev. Lett. 92, 035504 (2004)Size-asymmetric Grand CanonicalDouglas Ashton2010-05-18 | Grand canonical simulation of highly size-asymmetric hard discs. Large particles are introduced by starting out as a ghost particle that does not interact and then gradually turning up the interaction strength. The size ratio here is 40:1.