Cycle basis Markov chains for the Ising model
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of magnetic materials (82D40)
Recommendations
- Polynomial-Time Approximation Algorithms for the Ising Model
- The Ising partition function: zeros and deterministic approximation
- Stratified sampling for the Ising model: A graph-theoretic approach
- scientific article; zbMATH DE number 177833
- Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids
Cited in
(4)- The Ising partition function for 2D grids with periodic boundary: Computation and analysis
- Stratified sampling for the Ising model: A graph-theoretic approach
- scientific article; zbMATH DE number 992657 (Why is no real title available?)
- Bootstrap, Markov chain Monte Carlo, and LP/SDP hierarchy for the lattice Ising model
This page was built for publication: Cycle basis Markov chains for the Ising model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5195035)