Stein's method, Jack measure, and the Metropolis algorithm

DOI10.1016/J.JCTA.2004.07.003MaRDI QIDQ703689zbMATH OpenOpenAlexFDO

Authors Jason Fulman

Publication date 11 January 2005

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Stein's methodPlancherel measureCentral limit theoremJack polynomialSpherical function

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of representation theory (05E10)

Abstract: The one parameter family of Jack(alpha) measures on partitions is an important discrete analog of Dyson's beta ensembles of random matrix theory. Except for special values of alpha=1/2,1,2 which have group theoretic interpretations, the Jack(alpha) measure has been difficult if not intractable to analyze. This paper proves a central limit theorem (with an error term) for Jack(alpha) measure which works for arbitrary values of alpha. For alpha=1 we recover a known central limit theorem on the distribution of character ratios of random representations of the symmetric group on transpositions. The case alpha=2 gives a new central limit theorem for random spherical functions of a Gelfand pair. The proof uses Stein's method and has interesting ingredients: an intruiging construction of an exchangeable pair, properties of Jack polynomials, and work of Hanlon relating Jack polynomials to the Metropolis algorithm.

Recommendations

• A limit theorem for the Jack deformation of Plancherel measures
• Jack deformations of Plancherel measures and traceless Gaussian random matrices
• Stein’s method and Plancherel measure of the symmetric group
• Stein's method and random character ratios
• On the error bound in the normal approximation for Jack measures

Cites work

• scientific article; zbMATH DE number 431548 (Why is no real title available?)
• scientific article; zbMATH DE number 50805 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 124397 (Why is no real title available?)
• scientific article; zbMATH DE number 152091 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 1549030 (Why is no real title available?)
• scientific article; zbMATH DE number 1857665 (Why is no real title available?)
• scientific article; zbMATH DE number 848097 (Why is no real title available?)
• A Markov chain on the symmetric group and Jack symmetric functions
• Anisotropic Young diagrams and Jack symmetric functions
• Asymptotics of Plancherel measures for symmetric groups
• Asymptotics of numbers of branched coverings of a torus and volumes of moduli spaces of holomorphic differentials
• Card shuffling and the decomposition of tensor products.
• Central limit theorem for the adjacency operators on the infinite symmetric group
• Discrete orthogonal polynomial ensembles and the Plancherel measure
• Equation of state calculations by fast computing machines
• Generating a random permutation with random transpositions
• Harmonic functions on multiplicative graphs and interpolation polynomials
• Integrable systems and combinatorial theory.
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Martingales and character ratios
• On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Random walks on trees and matchings
• Some combinatorial properties of Jack symmetric functions
• Stein's method and random character ratios
• Stein’s method and Plancherel measure of the symmetric group
• The uses of random partitions
• What do we know about the Metropolis algorithm?
• \(Z\)-measures on partitions and their scaling limits

Cited in

(21)

• Law of large numbers and central limit theorems through Jack generating functions
• Stein’s method and Plancherel measure of the symmetric group
• Statistical properties of eigenvalues of Laplace-Beltrami operators
• On the error bound in the normal approximation for Jack measures
• Martingales and character ratios
• Anisotropic Young diagrams and Jack symmetric functions
• Gaussian fluctuations of Jack-deformed random Young diagrams
• Gaussian fluctuations of Young diagrams and structure constants of Jack characters
• Stein's method and random character ratios
• Stein's method via induction
• A note on the exchangeability condition in Stein's method
• Convergence rates of random walk on irreducible representations of finite groups
• Effect of microscopic pausing time distributions on the dynamical limit shapes for random Young diagrams
• A limit theorem for the Jack deformation of Plancherel measures
• The Berry-Esseen bound for character ratios
• Separation cutoffs for random walk on irreducible representations
• Zero biasing and Jack measures
• Fluctuations of particle systems determined by Schur generating functions
• Tensor product Markov chains
• Commutation relations and Markov chains
• Discretized normal approximation for the number of descents

This page was built for publication: Stein's method, Jack measure, and the Metropolis algorithm

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