UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

RIGOROUS LOWER BOUND ON THE DYNAMIC CRITICAL EXPONENT OF SOME MULTILEVEL SWENDSEN-WANG ALGORITHMS

LI, XJ; SOKAL, AD; (1991) RIGOROUS LOWER BOUND ON THE DYNAMIC CRITICAL EXPONENT OF SOME MULTILEVEL SWENDSEN-WANG ALGORITHMS. PHYS REV LETT , 67 (12) 1482 - 1485.

Full text not available from this repository.

Abstract

We prove the rigorous lower bound z(exp) greater-than-or-equal-to alpha/nu for the dynamic critical exponent of a broad class of multilevel (or "multigrid") variants of the Swendsen-Wang algorithm. This proves that such algorithms do suffer from critical slowing down. We conjecture that such algorithms in fact lie in the same dynamic universality class as the standard Swendsen-Wang algorithm.

Type:Article
Title:RIGOROUS LOWER BOUND ON THE DYNAMIC CRITICAL EXPONENT OF SOME MULTILEVEL SWENDSEN-WANG ALGORITHMS
Keywords:ISING-MODEL, SIMULATIONS
UCL classification:UCL > School of BEAMS > Faculty of Maths and Physical Sciences > Mathematics

Archive Staff Only: edit this record