Graphical representations and worm algorithms for the O(N) spin model

DOI10.1088/1572-9494/ACFBDFMaRDI QIDQ6497879FDOQ6497879

Authors: Longxiang Liu, Lei Zhang, Xiao-Jun Tan, Youjin Deng 

Publication date: 6 May 2024

Published in: Communications in Theoretical Physics (Search for Journal in Brave)

zbMATH Keywords

graphical representationscontinuous spin modelsMarkov-chain Monte Carlo algorithms

Mathematics Subject Classification ID

Quantum theory (81-XX)

Cites Work

• Analysis of a nonreversible Markov chain sampler.
• Equation of state calculations by fast computing machines
• Irreversible Monte Carlo algorithms for efficient sampling
• Title not available (Why is that?)
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Title not available (Why is that?)
• Numerical study of the enlarged \(O(5)\) symmetry of the 3D antiferromagnetic \(\mathbb R\mathbb P^{2}\) spin model
• ``Worm algorithm in quantum Monte Carlo simulations
• Dual lattice representations for \(\mathrm{O}(N)\) and \(\mathrm{CP}(N - 1)\) models with a chemical potential
• Title not available (Why is that?)

This page was built for publication: Graphical representations and worm algorithms for the \(O(N)\) spin model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497879)