scientific article
From MaRDI portal
Publication:3138330
zbMath0789.05091MaRDI QIDQ3138330
Persi Diaconis, Philip J. Hanlon
Publication date: 15 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
eigenvaluessimulated annealingMarkov chainKrawtchouk polynomialsMetropolis algorithmJack polynomials
Symmetric functions and generalizations (05E05) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items
Bijection between oriented maps and weighted non-oriented maps, The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations., On adding a list of numbers (and other one-dependent determinantal processes), The top-degree part in the matchings-Jack conjecture, Hypergroup deformations and Markov chains, Fundamental weight systems are quantum states, Random walks generated by the Ewens distribution on the symmetric group, First hitting time analysis of the independence Metropolis sampler, The cutoff phenomenon for Ehrenfest chains, Heuristics from Nature for Hard Combinatorial Optimization Problems, A geometric interpretation of the Metropolis-Hastings algorithm., Separation cutoffs for random walk on irreducible representations, A probabilistic interpretation of the Macdonald polynomials, Asymptotics of Jack characters, Convergence rates of random walk on irreducible representations of finite groups, Stein's method, Jack measure, and the Metropolis algorithm, The \(L^{2}\)-cutoff for reversible Markov processes, Separation cut-offs for birth and death chains, Commutation relations and Markov chains, What do we know about the Metropolis algorithm?, To the Latimer-Macduffee theorem and beyond!, Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution
