Monte Carlo without chains

From MaRDI portal
Publication:1018992

DOI10.2140/CAMCOS.2008.3.77zbMATH Open1165.65302arXiv0802.1046OpenAlexW2964237536MaRDI QIDQ1018992FDOQ1018992

Alexandre J. Chorin

Publication date: 26 May 2009

Published in: Communications in Applied Mathematics and Computational Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0802.1046






Cited In (3)






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)