arXiv Analytics

Sign in

arXiv:math/0610240 [math.PR]AbstractReferencesReviewsResources

Asymptotics of Plancherel-type random partitions

Alexei Borodin, Grigori Olshanski

Published 2006-10-07, updated 2007-02-20Version 2

We present a solution to a problem suggested by Philippe Biane: We prove that a certain Plancherel-type probability distribution on partitions converges, as partitions get large, to a new determinantal random point process on the set {0,1,2,...} of nonnegative integers. This can be viewed as an edge limit ransition. The limit process is determined by a correlation kernel on {0,1,2,...} which is expressed through the Hermite polynomials, we call it the discrete Hermite kernel. The proof is based on a simple argument which derives convergence of correlation kernels from convergence of unbounded self-adjoint difference operators. Our approach can also be applied to a number of other probabilistic models. As an example, we discuss a bulk limit for one more Plancherel-type model of random partitions.

Comments: AMS TeX, 19 pages. Version 2: minor typos fixed
Journal: J. Algebra 313 (2007), no. 1, 40-60.
Categories: math.PR, math-ph, math.MP
Subjects: 60C05, 60G55, 33C45
Related articles: Most relevant | Search more
arXiv:1607.07636 [math.PR] (Published 2016-07-26)
Asymptotics for the Time of Ruin in the War of Attrition
arXiv:1612.06835 [math.PR] (Published 2016-12-20)
Box constrained $\ell_1$ optimization in random linear systems -- asymptotics
arXiv:1110.1324 [math.PR] (Published 2011-10-06, updated 2012-08-23)
Asymptotics for the Length of the Longest Increasing Subsequence of Binary Markov Random Word