Simulation reductions for the Ising model

DOI10.1080/15598608.2011.10412038MaRDI QIDQ2324151zbMATH OpenOpenAlexFDO

Authors Mark Huber

Publication date 13 September 2019

Published in Journal of Statistical Theory and Practice (Search for Journal in Brave)

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

zbMATH Keywords

Monte CarloIsing modelhigh-temperature expansionsimulation reduction

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Monte Carlo methods applied to problems in statistical mechanics (82M31)

Abstract: Polynomial time reductions between problems have long been used to delineate problem classes. Simulation reductions also exist, where an oracle for simulation from some probability distribution can be employed together with an oracle for Bernoulli draws in order to obtain a draw from a different distribution. Here linear time simulation reductions are given for: the Ising spins world to the Ising subgraphs world and the Ising subgraphs world to the Ising spins world. This answers a long standing question of whether such a direct relationship between these two versions of the Ising model existed. Moreover, these reductions result in the first method for perfect simulation from the subgraphs world and a new Swendsen-Wang style Markov chain for the Ising model. The method used is to write the desired distribution with set parameters as a mixture of distributions where the parameters are at their extreme values.

Recommendations

• Simulation reduction of the Ising model to general matchings
• Monte Carlo simulations of Ising models
• Algebraic reduction of the Ising model
• Optimised simulated annealing for Ising spin glasses
• Efficient parallel simulations of dynamic Ising spin systems
• A Monte Carlo sampling scheme for the Ising model
• A binomial approximation method for the Ising model
• The Ising model with hybrid Monte Carlo
• Correlated reduced transfer matrix approach for Ising model

Cites work

• scientific article; zbMATH DE number 3513115 (Why is no real title available?)
• scientific article; zbMATH DE number 1305538 (Why is no real title available?)
• scientific article; zbMATH DE number 479937 (Why is no real title available?)
• scientific article; zbMATH DE number 3041992 (Why is no real title available?)
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• On the Theory of the Ising Model of Ferromagnetism
• Polynomial-Time Approximation Algorithms for the Ising Model
• Random generation of combinatorial structures from a uniform distribution

Cited in

(4)

• Simulation reduction of the Ising model to general matchings
• Computational thresholds for the fixed-magnetization Ising model
• A fast algorithm for the Cyber 205 to simulate the 3D Ising model
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width

This page was built for publication: Simulation reductions for the Ising model

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