The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram
Abstract
Let p(n) be the number of all integer partitions of the positive integer n and let λ be a partition, selected uniformly at random from among all such p(n) partitions. It is known that each partition λ has a unique graphical representation, composed by n non-overlapping cells in the plane called Young diagram. As a second step of our sampling experiment, we select a cell c uniformly at random from among all n cells of the Young diagram of the partition λ. For large n, we study the asymptotic behavior of the hook length Zn=Zn(λ,c) of the cell c of a random partituion λ. This two-step sampling procedure suggests a product probability measure, which assigns the probability 1/np(n) to each pair (λ,c). With respect to this probability measure, we show that the random variable π Zn/6n converges weakly, as n∞, to a random variable whose probability density function equals 6y/π2 (ey-1) if 0<y<∞, and zero elsewhere.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.