Stein's Method, Jack Measure, and the Metropolis Algorithm

Details Stein's Method, Jack Measure, and the Metropolis Algorithm Stein's Method, Jack Measure, and the Metropolis Algorithm

2003-11-17

arxiv.org/abs/math/0311290v2

Mathematics

Combinatorics

very minor revisions; fix a few misprints and update bibliography

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stein's Method, Jack Measure, and the Metropolis Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stein's Method, Jack Measure, and the Metropolis Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stein's Method, Jack Measure, and the Metropolis Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605593