scientific article; zbMATH DE number 431548

MaRDI QIDQ3138330zbMATH OpenFDO

Authors Persi Diaconis, Philip J. Hanlon

Publication date 15 December 1993

zbMATH Keywords

eigenvaluesJack polynomialsKrawtchouk polynomialsMarkov chainMetropolis algorithmsimulated annealing

Mathematics Subject Classification ID

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

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

Cited in

(29)

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