Convergence rates of Markov chains for some self-assembly and non-saturated Ising models

DOI10.1016/j.tcs.2008.12.007zbMath1170.60027OpenAlexW2014980539MaRDI QIDQ1008719

Dana Randall, Sam Greenberg

Publication date: 30 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.007

zbMATH Keywords

phase transitionMarkov chainIsing modelself-assemblysampling algoruthm

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster random generation of linear extensions
• Bound on the mass gap for finite volume stochastic Ising models at low temperature
• Polynomial-Time Approximation Algorithms for the Ising Model
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Slow mixing of glauber dynamics via topological obstructions
• A more rapidly mixing Markov chain for graph colorings
• On the swapping algorithm
• Equation of State Calculations by Fast Computing Machines
• DNA Computing

This page was built for publication: Convergence rates of Markov chains for some self-assembly and non-saturated Ising models