A Markov chain on the symmetric group and Jack symmetric functions

DOI10.1016/0012-365X(92)90370-UzbMath0774.05098MaRDI QIDQ1191948

Philip J. Hanlon

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Jack symmetric functionsrandom walkssymmetric groupMarkov chaintransition matrixMetropolis algorithmtransitional probability

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Symmetric functions and generalizations (05E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\)., On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions, Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains, Markov chain convergence: From finite to infinite, Polynomial properties of Jack connection coefficients and generalization of a result by Dénes, Random walks generated by the Ewens distribution on the symmetric group, Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions, A probabilistic interpretation of the Macdonald polynomials, Stein's method, Jack measure, and the Metropolis algorithm, The smallest eigenvalue for reversible Markov chains, Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution

Cites Work

• Jack symmetric functions and some combinatorial properties of Young symmetrizers
• Some combinatorial properties of Jack symmetric functions
• Generating a random permutation with random transpositions
• Equation of State Calculations by Fast Computing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item