scientific article; zbMATH DE number 431548

zbMATH Open0789.05091MaRDI QIDQ3138330FDOQ3138330

Authors: Persi Diaconis, Philip J. Hanlon 

Publication date: 15 December 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1263187
• What do we know about the Metropolis algorithm?
• On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
• Micro-local analysis for the Metropolis algorithm
• Metropolis

zbMATH Keywords

Markov chainsimulated annealingeigenvaluesMetropolis algorithmJack polynomialsKrawtchouk polynomials

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Continuous-time Markov processes on discrete state spaces (60J27)

Cited In (27)

• Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution
• First hitting time analysis of the independence Metropolis sampler
• The top-degree part in the matchings-Jack conjecture
• To the Latimer-Macduffee theorem and beyond!
• Heuristics from Nature for Hard Combinatorial Optimization Problems
• Micro-local analysis for the Metropolis algorithm
• Convergence rates of random walk on irreducible representations of finite groups
• Hypergroup deformations and Markov chains
• The cutoff phenomenon for Ehrenfest chains
• On adding a list of numbers (and other one-dependent determinantal processes)
• Asymptotics of Jack characters
• Multidimensional examples of the Metropolis algorithm
• Bijection between oriented maps and weighted non-oriented maps
• Fundamental weight systems are quantum states
• Stein's method, Jack measure, and the Metropolis algorithm
• Performance of the Metropolis algorithm on a disordered tree: the Einstein relation
• Spectral asymptotics for the Metropolis algorithm on singular domains
• The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations.
• Mixing reversible Markov chains in the max-\(\ell^2\)-distance
• A probabilistic interpretation of the Macdonald polynomials
• The \(L^{2}\)-cutoff for reversible Markov processes
• Random walks generated by the Ewens distribution on the symmetric group
• What do we know about the Metropolis algorithm?
• Separation cut-offs for birth and death chains
• Separation cutoffs for random walk on irreducible representations
• A geometric interpretation of the Metropolis-Hastings algorithm.
• Commutation relations and Markov chains

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