scientific article; zbMATH DE number 1189245

MaRDI QIDQ3839010zbMATH OpenFDO

Authors Dana Randall, Prasad Tetali

Publication date 4 March 1999

zbMATH Keywords

Glauber dynamicsMarkov chain Monte Carlo algorithmnon-local algorithmspolynomial boundsrandom samplingupdate algorithms

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Monte Carlo methods (65C05)

Recommendations

• Analyzing Glauber dynamics by comparison of Markov chains
• Analysis of a large number of Markov chains competing for transitions
• Analysis of a Bose-Einstein Markov chain
• Analytical perturbations in Markov chains
• Analysis of Stiff Markov Chains
• Analysis of non-reversible Markov chains via similarity orbits
• A new method for analysing the equilibrium and time-dependent behaviour of Markovian models
• Markov chains. Analytic and Monte Carlo computations
• Markov chain comparison

Cited in

(6)

• How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
• Analyzing Glauber dynamics by comparison of Markov chains
• Markov chain algorithms for planar lattice structures
• On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
• Some circumstances where extra updates can delay mixing
• Mixing on generalized associahedra

This page was built for publication:

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