Monte Carlo without chains
From MaRDI portal
Publication:1018992
Abstract: A sampling method for spin systems is presented. The spin lattice is written as the union of a nested sequence of sublattices, all but the last with conditionally independent spins, which are sampled in succession using their marginals. The marginals are computed concurrently by a fast algorithm; errors in the evaluation of the marginals are offset by weights. There are no Markov chains and each sample is independent of the previous ones; the cost of a sample is proportional to the number of spins (but the number of samples needed for good statistics may grow with array size). The examples include the Edwards-Anderson spin glass in three dimensions.
Recommendations
Cited in
(16)- Computing the partition function, ensemble averages, and density of states for lattice spin systems by sampling the mean
- MULTISPIN CODING TECHNIQUE FOR NONEQUILIBRIUM REWEIGHTING
- scientific article; zbMATH DE number 2226657 (Why is no real title available?)
- Space dependent mean field approximation modelling
- Go with the winners: a general Monte Carlo strategy
- Sewing algorithm
- The use of optimized Monte Carlo methods for studying spin glasses
- Monte Carlo simulation in Fourier space
- Non-reversible Monte Carlo simulations of spin models
- A Monte Carlo sampling scheme for the Ising model
- A Markov-property Monte Carlo method: one-dimensional Ising model
- Improvement of the Monte Carlo projector method for spin systems
- Note on Monte Carlo methods without necessary detailed balance.
- scientific article; zbMATH DE number 3978251 (Why is no real title available?)
- Multispin Monte Carlo method
- Accelerated algorithms. I: Lattice models
This page was built for publication: Monte Carlo without chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018992)