Simulation reduction of the Ising model to general matchings

DOI10.1214/EJP.V17-1998MaRDI QIDQ428651zbMATH OpenOpenAlexFDO

Authors Mark Huber, Jenny Law

Publication date 22 June 2012

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/ejp.v17-1998

zbMATH Keywords

Monte CarloIsing modelcanonical pathsfully polynomial time approximation schemesimulation reduction

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Simulation reductions for the Ising model
• scientific article; zbMATH DE number 177833
• Adaptive simulated annealing: A near-optimal connection between sampling and counting
• Polynomial-Time Approximation Algorithms for the Ising Model
• Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

Cited in

(2)

• Simulation reductions for the Ising model
• Stratified sampling for the Ising model: A graph-theoretic approach

This page was built for publication: Simulation reduction of the Ising model to general matchings

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