Hahn polynomials and the Burnside process

DOI10.1007/S11139-021-00482-ZMaRDI QIDQ6098229zbMATH OpenFDO

Authors Persi Diaconis, Chen-Yang Zhong

Publication date 13 June 2023

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.13829

zbMATH Keywords

auxiliary variablesbeta-binomial distributionBurnside processHahn polynomialsMallows model on permutationsorthogonal polynomial eigenfunctions

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Abstract: We study a natural Markov chain on $0,1,cdots,n$ with eigenvectors the Hahn polynomials. This explicit diagonalization makes it possible to get sharp rates of convergence to stationarity. The process, the Burnside process, is a special case of the celebrated `Swendsen-Wang' or `data augmentation' algorithm. The description involves the beta-binomial distribution and Mallows model on permutations. It introduces a useful generalization of the Burnside process.

Recommendations

• scientific article; zbMATH DE number 1301969
• The ‘Burnside Process’ Converges Slowly
• Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions
• Characterization by orthogonal polynomial systems of finite Markov chains

Cites work

• A probabilistic interpretation of the Macdonald polynomials
• A Stochastic Approach to the Gamma Function
• An introduction to multivariate Krawtchouk polynomials and their applications
• Analysis of a Bose-Einstein Markov chain
• Askey-Wilson polynomials, quadratic harnesses and martingales
• Automating Pólya theory: The computational complexity of the cycle index polynomial
• Computation in permutation groups: Counting and randomly sampling orbits
• Continuous-time Markov chains. An applications-oriented approach
• Donkey walk and Dirichlet distributions
• Gibbs sampling, exponential families and orthogonal polynomials
• Hit and run as a unifying device
• scientific article; zbMATH DE number 3170494 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 3518091 (Why is no real title available?)
• scientific article; zbMATH DE number 3605240 (Why is no real title available?)
• scientific article; zbMATH DE number 475376 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• scientific article; zbMATH DE number 774881 (Why is no real title available?)
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• scientific article; zbMATH DE number 2228141 (Why is no real title available?)
• Hypergeometric summation. An algorithmic approach to summation and special function identities
• Logarithmic combinatorial structures: A probabilistic approach
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On the Eigenvalues of Random Matrices
• Ordered Cycle Lengths in a Random Permutation
• Orthogonal polynomials of several variables
• Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions
• The latent roots of certain Markov chains arising in genetics: A new approach, I. Haploid models
• The ubiquitous Ewens sampling formula
• Tight frame with Hahn and Krawtchouk polynomials of several variables
• Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model

Cited in

(8)

• Limit profiles and cutoff for the Burnside process on Sylow double cosets
• Mixing times of a Burnside process Markov chain on set partitions
• On the number and sizes of double cosets of Sylow subgroups of the symmetric group
• Counting the number of group orbits by marrying the Burnside process with importance sampling
• Random sampling of contingency tables and partitions: two practical examples of the Burnside process
• Quantum vs classical birth and death processes; exactly solvable examples
• An algorithm for uniform generation of unlabeled (Pólya) trees
• The dual Burnside process

This page was built for publication: Hahn polynomials and the Burnside process

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