scientific article; zbMATH DE number 1246228

MaRDI QIDQ4226451zbMATH OpenFDO

Authors Mark Jerrum

Publication date 27 January 1999

zbMATH Keywords

algorithmsconvergencecouplingMarkov chain Monte Carlo methodrandom walksimulationstatistical design

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Monte Carlo methods (65C05) Probabilistic methods, stochastic differential equations (65C99)

Recommendations

• scientific article; zbMATH DE number 822898
• The Markov chain Monte Carlo revolution
• Markov Chain Monte Carlo Algorithms: Theory and Practice
• scientific article; zbMATH DE number 1342087

Cited in

(25)

• Forests, colorings and acyclic orientations of the square lattice
• Stopping tests for Markov chain Monte-Carlo methods
• On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model
• Improved mixing rates of directed cycles by added connection
• Efficiency test of pseudorandom number generators using random walks
• Random walks on a finite graph with congestion points
• Monte Carlo Markov chains constrained on graphs for a target with disconnected support
• The Wang-Landau algorithm reaches the flat histogram criterion in finite time
• Radiocoloring in planar graphs: Complexity and approximations
• The computational complexity of estimating MCMC convergence time
• The Markov chain Monte Carlo revolution
• scientific article; zbMATH DE number 1222286 (Why is no real title available?)
• Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
• A general limitation on Monte Carlo algorithms of the Metropolis type
• MC's for MCMC'ists
• scientific article; zbMATH DE number 795109 (Why is no real title available?)
• scientific article; zbMATH DE number 822898 (Why is no real title available?)
• Random walks and the universe of districting plans
• MCMC with strings and branes: the suburban algorithm (extended version)
• Markov chain Monte Carlo on finite state spaces
• A Gibbs Sampler for a Class of Random Convex Polytopes
• Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
• Optimal sublinear sampling of spanning trees and determinantal point processes via average-case entropic independence
• On the spectral expansion of monotone subsets of the hypercube
• Explicit error bounds for lazy reversible Markov chain Monte Carlo

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 Q4226451)