On a Likely Shape of the Random Ferrers Diagram

We study the random partitions of a large integern, under the assumption that all such partitions are equally likely. We use Fristedt's conditioning device which connects the parts (summands) distribution to the one of ag-sequence, that is, a sequence of independent random variables, each distributed geometrically with a size-dependent parameter. Confirming a conjecture made by Arratia and Tavare, we prove that the joint distribution of counts of parts with size at mostsn?n1/2(at leastsn?n1/2, resp.) is close?in terms of the total variation distance?to the distribution of the firstsncomponents of theg-sequence (of theg-sequence minus the firstsn?1 components, resp.). We supplement these results with the estimates for the middle-sized parts distribution, using the analytical tools revolving around the Hardy?Ramanujan formula for the partition function. Taken together, the estimates lead to an asymptotic description of the random Ferrers diagram, close to the one obtained earlier by Szalay and Turan. As an application, we simplify considerably and strengthen the Szalay?Turan formula for the likely degree of an irreducible representation of the symmetric groupSn. We show further that both the size of a random conjugacy class and the size of the centraliser for every element from the class are doubly exponentially distributed in the limit. We prove that a continuous time process that describes the random fluctuations of the diagram boundary from the deterministic approximation converges to a Gaussian (non-Markov) process with continuous sample path. Convergence is such that it implies weak convergence of every integral functional from a broad class. To demonstrate applicability of this general result, we prove that the eigenvalue distribution for the Diaconis?Shahshahani card-shuffling Markov chain is asymptotically Gaussian with zero mean, and variance of ordern?3/2.

[1]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[2]  H. Temperley.  Statistical mechanics and the partition of numbers II. The form of crystal surfaces , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  W. Ledermann.  Introduction to Group Characters , 1977 .

[4]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[5]  G. Hardy,et al.  Asymptotic formulae in combinatory analysis , 1918 .

[6]  J. S. Frame,et al.  The Hook Graphs of the Symmetric Group , 1954, Canadian Journal of Mathematics.

[7]  H. Wilf,et al.  Another probabilistic formula in the theory of Young tableaux , 1984 .

[8]  I. I. Gikhman,et al.  The Theory of Stochastic Processes III , 1979 .

[9]  Topics in classical number theory , 1984 .

[10]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[11]  Boris G. Pittel.  On growing a random young tableau , 1986, J. Comb. Theory, Ser. A.

[12]  William M. Y. Goh,et al.  The Number of Distinct Part Sizes in a Random Integer Partition , 1995, J. Comb. Theory, Ser. A.

[13]  H. Wilf,et al.  A probabilistic proof of a formula for the number of Young tableaux of a given shape , 1979 .

[14]  B. Logan,et al.  A Variational Problem for Random Young Tableaux , 1977 .

[15]  P. Erdos,et al.  On some problems of a statistical group-theory. II , 1967 .

[16]  Bert Fristedt,et al.  The structure of random partitions of large integers , 1993 .

[17]  P. Turán,et al.  On some problems of the statistical theory of partitions with application to characters of the symmetric group. II , 1977 .

[18]  Zhuzhoma Evgeny Victorovich,et al.  Translation of Mathematical Monographs , 1996 .

[19]  Simon Tavare,et al.  Independent Process Approximations for Random Combinatorial Structures , 1994, 1308.3279.

[20]  L. A. Shepp,et al.  Ordered cycle lengths in a random permutation , 1966 .

[21]  A. Vershik,et al.  Asymptotic of the largest and the typical dimensions of irreducible representations of a symmetric group , 1985 .

[22]  R. Stanley.  Ordered Structures And Partitions , 1972 .

[23]  Herbert S. Wilf,et al.  Three Problems in Combinatorial Asymptotics , 1983, J. Comb. Theory, Ser. A.

[24]  G. Hardy,et al.  Asymptotic Formulaæ in Combinatory Analysis , 1918 .

[25]  R. Durrett.  Probability: Theory and Examples , 1993 .

[26]  Simon Tavaré,et al.  Total Variation Asymptotics for Poisson Process Approximations of Logarithmic Combinatorial Assemblies , 1995 .

[27]  R. E. Ingram.  Some characters of the symmetric group , 1950 .

[28]  P. Erdös,et al.  The distribution of the number of summands in the partitions of a positive integer , 1941 .

[29]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[30]  Curtis Greene,et al.  Another Probabilistic Method in the Theory of Young Tableaux , 1984, J. Comb. Theory, Ser. A.