Groupe de Physique Statistique

Equipe 106, Institut Jean Lamour

                     
Accueil
Accès
Personnel
Publications
Séminaires
Chronologique
par Orateurs
Ateliers
Rencontres
Ecoles
International
Grp Travail
Theses, Postes
Enseignement

Séminaire de groupe

Worm Algorithm in Ordered and Disordered Media
Martin Marenz
ITP Leipzig
lundi 17 octobre 2011 , 10h25
Salle de séminaire du groupe de Physique Statistique

The Worm algorithm is a Monte Carlo method that uses the high-temperature expansion for simulating spin systems. It was introduces by Prokof'ev and Svistinov in 2001~\cite{Prokof2001}. This work and a few other papers suggest that it do not suffer from the critical slowing down. We investigated the critical behavior of the algorithm, which means we have calculated the dynamic critical exponents. This procedure have also been done for bond disordered and site diluted systems, therefore we expanded the algorithm to such systems and introduced several estimators for common observables. We could affirm that the critical slowing down has no practical influence for the Worm algorithm, this also holds for disordered and diluted systems. N. Prokof'ev and B. Svistunov, \emph{Worm Algorithm for Classical Statistical Models}, Phys. Rev. Lett. 16 (2001) 160601,



Haut de page