209 citations · 1.2k across the 68 of their papers we have counts for
Showing 2006 · math.PRShow all
3 papers · 2 filters
math.PR2006★ 46 cited
Asymptotics of Plancherel-type random partitions
Alexei Borodin, Grigori Olshanski
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, t…
math.PR2006★ 4 cited
Meixner polynomials and random partitions
Alexei Borodin, Grigori Olshanski
The paper deals with a 3-parameter family of probability measures on the set of partitions, called the z-measures. The z-measures first emerged in connection with the problem of ha…
math.PR2006★ 1 cited
The boundary of the Eulerian number triangle
Alexander Gnedin, Grigori Olshanski
The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solution…