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

From MaRDI portal
Publication:703689

DOI10.1016/J.JCTA.2004.07.003zbMATH Open1055.05152arXivmath/0311290OpenAlexW2033130993MaRDI QIDQ703689FDOQ703689


Authors: Jason Fulman Edit this on Wikidata


Publication date: 11 January 2005

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

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.


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




Recommendations




Cites Work


Cited In (21)





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)