Gaussian fluctuations of Jack-deformed random Young diagrams

We introduce a large class of random Young diagrams which can be regarded as a natural one-parameter deformation of some classical Young diagram ensembles; a deformation which is related to Jack polynomials and Jack characters. We show that each such a random Young diagram converges asymptotically to some limit shape and that the fluctuations around the limit are asymptotically Gaussian.

Random partitions occur in mathematics and physics in a wide variety of contexts, in particular in the Gromov-Witten and Seiberg-Witten theories, see the overview articles of Okounkov [Oko03] and Vershik [Ver95].
1.2. . . . and random matrices. Certain random partitions can be regarded as discrete counterparts of some interesting ensembles of random matrices. We shall explore this link on a particular example of random matrices called β-ensembles or β-log gases [For10], i.e. the probability distributions on R n with the density of the form where V is some real-valued function and Z is the normalization constant.
In the special cases β ∈ {1, 2, 4} they describe the joint distribution of the eigenvalues of random matrices with natural symmetries; the investigation of such ensembles for a generic value of β is motivated, among others, by statistical mechanics. In this general case the problem of computing their correlation functions heavily relies on Jack polynomial theory [For10, Chapter 13].
1.3. Random Young diagrams related to log-gases. Opposite to the special cases β ∈ {1, 2, 4}, in the generic case of β-ensembles there seems to be no obvious unique way of defining their discrete counterparts and several alternative approaches are available, see the work of Moll [Mol15] as well as the work of Borodin, Gorin and Guionnet [BGG17]. In the current paper we took another approach based on a deformation of the character theory of the symmetric groups. The class of random Young diagrams considered in the current paper as well as the classes from [Mol15,BGG17] are of quite distinct flavors and it is not obvious why they should contain any elements in common, except for the trivial example given by the Jack-Plancherel measure. The problem of understanding the relations between these three classes does not seem to be easy and is out of the scope of the current paper.
1.4. Random Young diagrams and characters. The names integer partitions and Young diagrams are equivalent, but they are used in different contexts; for this reason we will use two symbols P n and Y n to denote the same object: the set of integer partitions of n, also known as the set of Young diagrams with n boxes. Any function on the set of partitions (or its some subset) will be referred to as character.
Suppose that for a given integer n ≥ 0 we are given some convenient family (χ λ ) of functions χ λ : P n → R which is indexed by λ ∈ Y n . We assume that (χ λ ) is a linear basis of the space of real functions on P n and that for each λ ∈ Y n χ λ (1 n ) = 1, where 1 n = (1, 1, . . . , 1) is a partition of n which consists of n parts, each equal to 1. We will refer to the functions from the family (χ λ ) as irreducible characters.
Our starting point is some character χ : P n → R which fulfills an analogous normalization χ(1 n ) = 1.
If the coefficients in this expansion are non-negative numbers, they define a probability measure P χ on the set Y n of Young diagrams with n boxes; this probability measure is in the focus of the current paper.
The most classical choice of the family (χ λ ) in (1.1) stems from the representation theory of the symmetric groups. For a Young diagram λ ∈ Y n with n boxes let ρ λ : S(n) → M k (R) denotes the corresponding irreducible representation [Sag01] of the symmetric group S(n). For a permutation π ∈ S(n) we define the value of the irreducible character χ λ of the symmetric group as the fraction of the traces (1.2) χ λ (π) := Tr ρ λ (π) Tr ρ λ (id) .
Since one can identify a permutation π with its cycle decomposition, it follows that the irreducible character χ λ (π) is also well-defined if π ∈ P n is a partition of n.
For this classical choice of (χ λ ) several results are available. Firstly, for a specific χ = χ reg given by 1.6. Irreducible Jack characters. In the current paper we will use another, more general, family (χ (α) λ ) of irreducible characters in (1.1). Our starting point is the family of Jack polynomials J (α) λ [Jac71] which can be regarded as a deformation of the family of Schur polynomials; a deformation that depends on the parameter α > 0. We use the normalization of Jack polynomials from [Mac95, Section VI.10].
It is worth pointing out that in the special case α = 1 the corresponding Jack character χ (1) λ (π) = χ λ (π) coincides with the irreducible character (1.2) of the symmetric group S(n), see [Las09,DF16]. If the coefficients P (α) χ (λ) ≥ 0 are non-negative, we will say that χ is a reducible Jack character. The resulting probability measure P (α) χ on Y n is in the focus of the current paper.
1.8. Random Young diagrams related to Thoma's characters. An additional motivation for considering this particular class of random Young diagrams stems from the research related to the problem of finding extremal characters of the infinite symmetric group S(∞), solved by Thoma [Tho64]. Vershik and Kerov [VK81] found an alternative, more conceptual proof of Thoma's result, which was based on the observation that characters of S(∞) are in a natural bijective correspondence with certain sequences (λ 1 ր λ 2 ր · · · ) of growing random Young diagrams.
The original Thoma's problem can be equivalently formulated as finding all homomorphisms from the ring of symmetric functions to real numbers which are Schur-positive, i.e. which take non-negative values on all Schur polynomials. In this formulation the problem naturally asks for generalizations in which Schur polynomials are replaced by another interesting family of symmetric functions. Kerov, Okounkov and Olshanski [KOO98] considered the particular case of Jack polynomials and they proved that a direct analogue of Thoma's result holds true also in this case. The main idea behind their proof was that the probabilistic viewpoint from the abovementioned work of Vershik and Kerov [VK81] can be adapted to the new setting of Jack polynomials. Thus, a side product of the work of Kerov, Okounkov and Olshanski is an interesting, natural class of random Young diagrams which fits into the framework which we consider in the current paper, see Section 1.16 and the forthcoming paper [DŚ18] for more details.
For partitions π 1 , . . . , π ℓ we define their cumulant with respect to the character χ : P → R as a coefficient in the expansion of the logarithm of an analogue of a multidimensional Laplace transform where the operations on the right-hand side should be understood in the sense of formal power series with coefficients either in R[P] or in R.
In the special case when each partition π i = (l i ) consist of just one part we will use a simplified notation and we will write k χ ℓ (l 1 , . . . , l ℓ ) = k χ ℓ (l 1 ), . . . , (l ℓ ) . For example, k χ 1 (l 1 ) = χ(l 1 ), k χ 2 (l 1 , l 2 ) = χ(l 1 , l 2 ) − χ(l 1 )χ(l 2 ). 1.10. Asymptotics. In the current paper we consider asymptotic problems which correspond to the limit when the number of boxes n → ∞ of the random Young diagrams tends to infinity. This corresponds to considering a sequence (χ n ) of reducible characters χ n : P n → R and the resulting sequence (P (α) χn ) of probability measures on Y n . We also allow that the deformation parameter α(n) depends on n; in order to make the notation light we will make this dependence implicit and write shortly α = α(n).
1.11. Hypothesis: asymptotics of α. All results of the current paper will be based on the assumption that α = α(n) is a sequence of positive numbers such that holds true for n → ∞ for some constants g, g ′ . Note that the most important case when α is constant fits into this framework with g = 0. The generic case g = 0 will be referred to as double scaling limit.
1.12. Hypothesis: approximate factorization of characters. In the following we will use the following convention. If χ n : P n → R is a function on the set of partitions of n, we will extend its domain to the set P ≤n := 0≤k≤n P k of partitions of smaller numbers by setting (1.10) χ n (π) := χ n (π, 1 n−|π| ) for |π| ≤ n, i.e. we extend the partition π by adding an appropriate number of parts, each equal to 1.
Definition 1.1. Assume that for each integer n ≥ 1 we are given a function χ n : P n → R. We say that the sequence (χ n ) has approximate factorization property [Śni06] if for each integer ℓ ≥ 1 and all integers l 1 , . . . , l ℓ ≥ 2 the limit (1.11) lim n→∞ k χn ℓ (l 1 , . . . , l ℓ ) n l 1 +···+l ℓ +ℓ−2 2 exists and is finite. We say that the sequence (χ n ) has enhanced approximate factorization property if, additionally, in the case ℓ = 1 the rate of convergence in (1.11) takes the following explicit form: for each l ≥ 2 there exist some constants a l+1 , b l+1 ∈ R such that where g is given by (1.9).
1.13.1. Anisotropic Young diagrams. The usual way of drawing Young diagrams is to represent each individual box as a unit square, see Figure 1 (left). However, when dealing with random Young diagrams related to Jack polynomials it is more convenient to represent each box as a rectangle with width w > 0 and height h > 0 such that A Young diagram viewed like this becomes a polygon contained in the uppper-right quaterplane which will be denoted by T w,h λ, see Figure 1 (right). We will refer to such polygons as anisotropic Young diagrams; they have been first considered by Kerov [Ker00].
1.13.2. Russian convention. Profile of a Young diagram. We draw (anisotropic) Young diagrams on the plane with the usual Cartesian coordinates (x, y). However, it is also convenient to use the Russian coordinate system (u, v) given by This new coordinate system gives rise to the Russian convention for drawing (anisotropic) Young diagrams, see Figure 2. The boundary of a Young diagram λ drawn in the Russian convention (the solid zigzag line on the right-hand side of Figure 2) is a graph of a function ω λ which will be called the profile of λ. If the Young diagram is replaced by an anisotropic Young diagram T w,h λ we define in an analogous way its profile ω T w,h λ .
1.14. The first main result: Law of Large Numbers. The following theorem is a generalization of the results of Biane [Bia01] who considered the special case α = 1 and the corresponding representations of the symmetric groups.
Theorem 1.3 (Law of large numbers). Assume that α = α(n) is such that (1.9) holds true. Assume that χ n : P n → R is a reducible Jack character; we denote by λ n the corresponding random Young diagram with n boxes distributed according to P (α) χn . We assume also that the sequence (χ n ) of characters fulfills the enhanced approximate factorization property. The proof is postponed to Section 5.
is a random function on the real line which quantifies the (suitably rescaled) discrepancy between the shape of the random (anisotropic) Young diagram Λ n and the limit shape. We will regard ∆ n as a Schwartz distribution on the real line R or, more precisely, as a random vector from this space.
The following result is a generalization of Kerov's CLT [Ker93a, IO02] which concerned Plancherel measure in the special case α = 1 as well as a generalization of its extension by the first-named author and Féray [DF16] for the generic fixed value of α > 0. Indeed, Example 1.2 shows that the assumptions of the following theorem are fulfilled for χ n := χ reg , thus CLT holds for Jack-Plancherel measure in a wider generality, when α = α(n) may vary with n.
On the other hand the following result is also a generalization of the results of the second-named author [Śni06] who considered a setup similar to the one below in the special case α = 1.
Theorem 1.5 (Central Limit Theorem). We keep the assumptions and the notations from Theorem 1.3.
Then for n → ∞ the random vector ∆ n converges in distribution to some (non-centered) Gaussian random vector ∆ ∞ valued in the space (R[x]) ′ of distributions, the dual space to polynomials.
The above statement about the convergence of the random vector ∆ n should be understood in a rather specific sense, formulated with help of some suitable test functions. Namely, for each finite collection of polynomials f 1 , . . . , f k ∈ C[x] we claim that the joint distribution of the random variables converges to the Gaussian distribution. Informally speaking: asymptotically, for n → ∞ where ω Λ∞ is a deterministic curve and ∆ ∞ is a Gaussian process.
Remark 1.6. In order to prove Theorem 1.5 it is enough to show that the joint distribution of any finite family of random variables (Y k ) k≥2 converges as n → ∞ to a (non-centered) Gaussian distribution, where is (up to a simple scalar factor) the value of the Schwartz distribution ∆ n evaluated on a suitable polynomial test function.
The proof is postponed to Section 6. with n ′ := αi 2 boxes. We will assume that n ′ is an even number. The special case α = 1 was considered already by Biane [Bia98, Figures 1-3]. Using a random iterative procedure introduced by Kerov [Ker96] which is an inverse of the Plancherel growth process and which will be presented in detail in a forthcoming paper [DŚ18] we remove half of the boxes from the rectangular Young diagram (i αi ); the resulting random Young diagram with n := 1 2 n ′ boxes will be denoted by λ n . We will use the same transformation T := T √ α n , √ 1 αn in order to scale both the original rectangular Young diagram (i αi ) as well as the resulting random Young diagram λ n . We notice that the anisotropic Young diagram T (i αi ) is a square, see Figure 3; we shall denote it by S. As we shall see in [DŚ18], the distribution of the random Young diagram λ n can be equivalently formulated The green square S depicts the anisotropic Young diagram T (i αi ) in the Russian coordinate system. The blue hatched triangle depicts the limit shape Λ ∞ ; the blue dashed line depicts the corresponding profile ω Λ∞ .
via (1.7) in terms of the corresponding natural reducible Jack character and Theorem 1.3 as well as Theorem 1.5 are applicable. Thus the sequence of random anisotropic Young diagrams Λ n = T λ n converges to some deterministic limit Λ ∞ . Not very surprisingly, this limit Λ ∞ turns out to be the bottom half of the square S, see Figure 3. Figures 4 and 5 are an illustration of the Law of Large Numbers (Theorem 1.3): as the number of boxes n → ∞ tends to infinity, suitably scaled random Young diagrams Λ n indeed seem to converge to the deterministic limit Λ ∞ .
In order to speak about CLT one should consider a more refined scaling: the one in which one stretches the second Russian coordinate v by a factor of √ n. This scaling has a bizarre feature: each individual box is drawn   Theorem 1.5 implies in particular that the limit exists as a Schwartz distribution on the real line; the convergence holds in the weak sense, i.e. the limit exists and is finite for an arbitrary integer k ≥ 0. The convergence in (1.19) is illustrated in Figures 6-8: the function E∆ n is the difference between the red solid curve (i.e. the plot of √ n Eω Λn ) and the blue dashed curve (i.e. the plot of √ n ω Λ∞ ). As one can see on these examples, the function E∆ n has oscillations of period and amplitude related to the grid of the boxes of the Young diagrams. As n → ∞, the amplitude of these oscillations does not converge to zero (so that the convergence in the FIGURE 6. The analogue of Figure 4 for the profiles √ n ω Λn for which only the second Russian coordinate v was anisotropically stretched by factor √ n. In this example α = 4, i = 5, n = 50. supremum norm does not hold) but their frequency tends to infinity (which is sufficient for convergence in the weak topology).
The central limit theorem in Theorem 1.5 is somewhat reminiscent to CLT for random walks. A significant difference lies in the nature of the limit object: in the case of the random walks it is the Brownian motion which has continuous trajectories while in the case considered in Theorem 1.5 it is a random Schwartz distribution ∆ ∞ for which computer simulations (such as the one shown in Figure 9) suggest that it has quite singular 'trajectories', reminiscent to that of the white noise. A systematic investigation of such trajectory-wise properties of ∆ ∞ via short-distance asymptotics of the covariance of the corresponding Gaussian field is out of the scope of the current paper.
1.17. Content of the paper. In Section 2 we introduce the main algebraic tool for our considerations, namely Theorem 2.3 which gives several convenient characterizations of the approximate factorization property. In Section 3 we prove this result. Section 4 is devoted to some technical results, mostly related to probability measures which are uniquely determined by their moments. In Section 5 we give the proof of Law of Large Numbers (Theorem 1.3). Finally, in Section 6 we give the proof of Central Limit Theorem (Theorem 1.5).

APPROXIMATE FACTORIZATION OF CHARACTERS
The purpose of this section is to give a number of conditions which are equivalent to the approximate factorization property (Definition 1.1). These conditions often turn out to be more convenient in applications, such as the ones from [DŚ18].
2.1. Conditional cumulants. Let A and B be commutative unital algebras and let E : A → B be a unital linear map. We will say that E is a conditional expectation value; in the literature one usually imposes some additional constraints on the structure of A, B and E, but for the purposes of the current paper such additional assumptions will not be necessary.  Figure 6 for α = 4, i = 20, n = 800. As n → ∞, the amplitude of the oscillations of the discrepancy √ n (Eω Λn − ω Λ∞ ) remain roughly constant, but their frequency tends to infinity and thus the discrepancy converges in the sense of Schwartz distributions.
For any tuple x 1 , . . . , x ℓ ∈ A we define their conditional cumulant as where the operations on the right-hand side should be understood in the sense of formal power series in variables t 1 , . . . , t ℓ .
Note that the cumulants for partitions which we introduced in Section 1.9 fit into this general framework: for A := R[P] one should take the semigroup algebra of partitions, for B := R the real numbers and for E := χ : R[P] → R the character.
2.2. Normalized Jack characters. The usual way of viewing the characters of the symmetric groups is to fix the irreducible representation λ and to consider the character as a function of the conjugacy class π. However, there is also another very successful viewpoint due to Kerov and Olshanski [KO94], called dual approach, which suggests to do roughly the opposite. Lassalle [Las08,Las09] adapted this idea to the framework of Jack characters. In order for this dual approach to be successful one has to choose the most convenient normalization constants. In the current paper we will use the normalization introduced by Dołęga and Féray [DF16] which offers some advantages over the original normalization of Lassalle. Thus, with the right choice of the multiplicative constant, the unnormalized Jack character χ (α) λ from (1.5) becomes the normalized Jack character Ch (α) π (λ), defined as follows.
Definition 2.1. Let α > 0 be given and let π be a partition. For any Young diagram λ the value of the normalized Jack character Ch (α) π (λ) is given by: where n k := n(n − 1) · · · (n − k + 1) denotes the falling power and χ (α) λ (π) is the Jack character (1.5). The choice of an empty partition π = ∅ is acceptable; in this case Ch Each Jack character depends on the deformation parameter α; in order to keep the notation light we will make this dependence implicit and we will simply write Ch π (λ).
2.3. The deformation parameters. In order to avoid dealing with the square root of the variable α which is ubiquitous in the subject of Jack deformation, we introduce an indeterminate A := √ α. The algebra of Laurent polynomials in the indeterminate A will be denoted by Q A, A −1 .
A special role will be played by the quantity which already appeared in the numerator on the left-hand side of (1.9).
2.4. The linear space of α-polynomial functions. In a paper [Śni18] the second-named author has defined a certain filtered linear space of α-polynomial functions. This linear space consists of certain functions in the set Y of Young diagrams with values in the ring Q A, A −1 of Laurent polynomials and, among many equivalent definitions, one can define it using normalized Jack characters.
Definition 2.2 ([Śni18, Proposition 5.2]). The linear space of α-polynomial functions is the linear span (with rational coefficients) of the functions over the integers k ≥ 0 and over partitions π ∈ P. The filtration on this vector space is specified as follows: for an integer n ≥ 0 the subspace of vectors of degree at most n is the linear span of the elements (2.3) over integers k ≥ 0 and over partitions π ∈ P such that k + |π| + ℓ(π) ≤ n.
2.5. Algebras P and P • of α-polynomial functions. The vector space of α-polynomial functions can be equipped with a product in two distinct natural ways (which will be reviewed in the following). With each of these two products it becomes a commutative, unital filtered algebra.
Firstly, as a product we may take the pointwise product of functions on Y. The resulting algebra will be denoted by P (the fact that the P is closed under such product was proved by Dołęga and Féray [DF16, Theorem 1.4]).
Secondly, as a product we may take the disjoint product •, see [Śni18, Section 2.3], which is defined on the linear base of Jack characters by concatenation (see Section 1.9) of the corresponding partitions The resulting algebra will be denoted by P • .
2.6. Two probabilistic structures on α-polynomial functions. Assume that χ : P n → R is a reducible Jack character and let P χ be the corresponding probability measure (1.7) on the set Y n of Young diagrams with n boxes. With this setup, functions on Y n can be viewed as random variables; we denote by E χ the corresponding expectation.
Let us fix a partition π ∈ P n ; we denote by χ λ (π) given by irreducible Jack character (1.5). From the way the probability measure P χ was defined in (1.7) it follows immediately that Any α-polynomial function F can be restricted to the set Y n of Young diagrams with n boxes; thus it makes sense to speak about its expected value E χ F . In the case when F = Ch π is a Jack character, this expected value can be explicitly calculated thanks to (2.4): By considering the multiplicative structure on α-polynomial functions given by the pointwise product, we get in this way a conditional expectation E χ : P → R; the corresponding cumulants will be denoted by κ χ ℓ . On the other hand, by considering the disjoint product, we get a conditional expectation E χ : P • → R; the corresponding cumulants will be denoted by κ χ •ℓ . 2.7. Equivalent characterizations of approximate factorization of characters. The following result, Theorem 2.3, is the key tool for the purposes of the current paper. Its main content is part (a); roughly speaking, it states that each of the four families of numbers (2.6)-(2.9) can be transformed into the others. Each of these four families describes some convenient aspect of the characters χ n in the limit n → ∞. To be more specific: • The family (2.8) (and its subset, the family (2.7)) has a direct probabilistic meaning. It contains information about the cumulants of some random variables which might be handy while proving probabilistic statements such as Central Limit Theorem or Law of Large Numbers. • On the other hand, the cumulants appearing in the families (2.6) and (2.9) are purely algebraic and do not have any direct probabilistic meaning. However, their merit lies in the fact that in many concrete applications (such as the ones from [DŚ18]) it is much simpler to verify algebraic conditions (A) and (D) than their probabilistic counterparts (B) and (C).
Theorem 2.3 (The key tool). Assume that α = α(n) is such as in Section 1.11. Assume also that for each integer n ≥ 1 we are given a reducible Jack character χ n : P n → R. (D) for each integer ℓ ≥ 1 and all x 1 , . . . , x ℓ ∈ P • the limit exists and is finite.
(b) Assume that the conditions from part (a) hold true. Furthermore, assume that for ℓ = 1 the rate of the convergence of any of the four expressions under the limit symbol in (2.6)-(2.9) is of the form (2.10) const 1 + const 2 +o(1) √ n in the limit n → ∞ and all choices of l 1 (respectively, for all choices of x 1 ); the constants depend on the choice of l 1 (respectively, x 1 ). Then for ℓ = 1 the rate of convergence of each of the four expressions (2.6)-(2.9) is of the form (2.10).
When α = 1, part (a) of the above result corresponds to [Śni06, Theorem and Definition 1]. The proof is postponed to Section 3.

PROOF OF THEOREM 2.3
In the current section we shall prove the key tool, Theorem 2.3. Additionally, concerning part (a) of Theorem 2.3 we shall discuss the exact relationship between the limits of the quantities (2.6)-(2.9) in the case ℓ ∈ {1, 2}. This relationship provides the information about the limit shape of random Young diagrams in Theorem 1.3 as well as about the covariance of the limit Gaussian process describing the fluctuations in Theorem 1.5.
Concerning part (b) of Theorem 2.3 we shall discuss the exact relationship between the constants which describe the fine asymptotics (2.10) of the quantities (2.6)-(2.9) in the case ℓ = 1. This relationship provides the information about the mean value E∆ ∞ of the limit Gaussian process from Equation (1.19).
Definition 3.1. Let A and B be filtered, commutative, unital algebras and let E : A → B be a unital map. We say that E has approximate factorization property if for all choices of x 1 , . . . , x ℓ ∈ A we have that . We consider the filtered unital algebras P • and P from Section 2.5, and as a conditional expectation between them we take the identity map: We denote by κ • := κ P P• the conditional cumulants related to the conditional expectation (3.2).
We are now ready to state the main auxiliary result, proved very recently by the second-named author, which will be necessary for the proof of the key tool, Theorem 2.3. 3.2. Approximate factorization for α = 1. We denote by P (1) a version of the filtered algebra of α-polynomial functions P obtained by the specialization α := 1, γ := 0; analogously we denote by P (1) • the algebra P (1) equipped with the multiplication given by the disjoint product.
The following result has been proved earlier by the second-named author. (1) • P (1) . id has approximate factorization property.
Theorems 3.2 and 3.3 are of the same flavor. There are two major differences between them: firstly, the arrows in (3.2) and (3.3) point in the opposite directions; secondly, the algebra P is more rich than its specialized version P (1) , in particular the variable γ ∈ P is not treated like a scalar since deg γ = 1 > 0.
3.3. Proof of Theorem 2.3, part (a). This proof follows closely its counterpart from the work of the second-named author [Śni06, Theorem and Definition 1] with the references to Theorem 3.3 replaced by Theorem 3.2 and, occasionally, the roles of P and P • reversed. We present the details below. The following result was proved by the second-named author [Śni06, Corollary 19] (note that the original paper does not contain the assumption (3.5) without which it is not true). The proof did not use any specific properties of the filtered algebra P and thus it remains valid also in our context when the original algebra of polynomial functions is replaced by the algebra of α-polynomial functions.
Lemma 3.4. Assume that X ⊆ P is a set with the property that each z ∈ P can be expressed as a polynomial in the elements of X: for some n ≥ 0 and z i,j ∈ X in such a way that such that for each value of 1 ≤ i ≤ n (3.5) deg z ≥ deg z i,1 + · · · + deg z i,l i ; in other words the degree of each monomial should be bounded from above by the degree of z.
Under the above assumption, if condition (B) holds true for all x 1 , . . . , x ℓ ∈ X then more general condition (C) holds true for arbitrary x 1 , . . . , x ℓ ∈ P.
The first summand on the right-hand side is of the form which is fits the framework given by the right-hand side of (3.4). By [DF16, Corollary 2.5, Corollary 3.8], the second summand on the right-hand side is of smaller degree, thus the inductive hypothesis can be applied. This concludes the proof.
We claim that (2.7) holds true for all x 1 , . . . , x ℓ ∈ X. Indeed, in the case when x 1 , . . . , x ℓ ∈ {Ch 1 , Ch 2 , . . . } this is just the assumption (C). Consider now the remaining case when x j = γ for some index j. For ℓ = 1 the corresponding expression from (2.8) is equal to which by (1.9) converges to a finite limit, as required. For ℓ ≥ 2, the corresponding cumulant κ χn ℓ (. . . , γ, . . . ) = 0 vanishes because it involves a deterministc random variable γ. It follows immediately that the limit (2.8) exists. In this way we verified that the assumptions of Lemma 3.4 are fulfilled. Condition (C) follows immediately.
3.3.3. Proof of the equivalence (C) ⇐⇒ (D).. The proof will follow closely the ideas from [Śni06, Section 4.7] with the roles of the cumulants κ χn and κ χn • interchanged. The original proof was based on the observation that the conditional cumulants (denoted in the original work [Śni06] by the symbol k id = κ P (1) • P (1) ) related to the map (3.3) fulfill the degree bounds (3.1) given by the approximate factorization property. By changing the meaning of the symbol k id and setting k id := κ P P• = κ • to be the conditional cumulants related to the map (3.2) and by applying Theorem 3.2 we still have in our more general context that the cumulants k id fulfill the degree bounds (3.1). The reasoning from [Śni06, Section 4.7] is still valid in our context. 3.4. Functionals S k . For a Young diagram λ, a real number α > 0 and an integer k ≥ 2 we define where the integral on the right-hand side is taken over a polygon on the plane defined by the Young diagram λ (drawn in the French convention). In order to keep the notation light we shall make the dependence on α implicit and we shall simply write S k (λ) := S (α) k (λ). In [Śni18, Proposition 4.6] the second-named author proved that S k ∈ P is an α-polynomial function of degree k.
3.5. Free cumulants R k . In many calculations related to the asymptotic representation theory it is convenient to parametrize the shape of the Young diagram λ by free cumulants R k (λ) (which depend on the parameter α in our settings). In the context of the representation theory of the symmetric groups these quantities have been introduced by Biane [Bia98].
For the purposes of the current paper it is enough to know that for a fixed Young diagram λ its sequence of functionals of shape and its sequence of free cumulants are related to each other by the following simple systems of equations [DFŚ10,Eqs. (14) and (15)]: where we use a shorthand notation S k = S k (λ), R k = R k (λ). In fact, the above-cited papers [Bia98,DFŚ10] concerned only the special isotropic case α = 1, however the passage to the anisotropic case α = 1 does not create any difficulties, see the work of Lassalle [Las09] (who used a different normalization constants) as well as of the first-named author and Féray [DF16] (whose normalization we use).
3.6. The case α = 1. The main advantage of free cumulants lies in the combination of the following two facts.
• Each free cumulant R k of a given Young diagram λ can be efficiently calculated [Bia98] and its dependence on the shape of λ takes a particularly simple form (more specifically, "R k is a homogeneous function").
• The family (γ, R 2 , R 3 , . . . ) forms a convenient algebraic basis of the algebra P with deg γ = 1 and deg R k = k. In the special case α = 1 (which corresponds to γ = 0) the expansion of Ch l in this basis takes the following, particularly simple form: (3.8) Ch l = R l+1 + (terms of degree at most l − 1).
One of the consequences of (3.8) is that in the special case α = 1 the relationship announced in Theorem 2.3(b) between the refined asymptotics of the four quantities (2.6)-(2.9) for ℓ = 1 takes the following, particularly simple form. Assume that there exists some sequence (a l ) with the property that for all l ≥ 1; (3.9) note that it is a stronger version of (2.10) with const 2 ≡ 0; then 14) see (3.6) for the last equality and [Śni06] for more details.
3.7. Details of Theorem 2.3 part (a) in the generic case α = 1. The original proof of [Śni06, Theorem and Definition 1] was based on the idea of expressing various elements F of the algebra of α-polynomial functions P (1) (such as the characters Ch π or the conditional cumulants κ • of such characters) as polynomials in the basis R 2 , R 3 , . . . of free cumulants and studying the top-degree of such polynomials, as we did in Section 3.6. In our more general context of α = 1 (or, in other words, γ = 0) the corresponding polynomial for F might have some extra terms which depend additionally on the variable γ. These extra terms might influence the asymptotic behavior of random Young diagrams. We shall discuss this issue in more detail in the remaining of this section as well as in Section 3.9. 3.7.1. The first-order asymptotics when α is constant. The first-named author and Féray [DF16, Proposition 3.7] proved that the degree of (3.15) F := Ch l with respect to the filtration from Section 3.6 remains equal to l + 1 even when we pass from P (1) to P or, in other words, that the degree of the extra terms is bounded from above by l + 1. In the asymptotics when α is a constant and does not depend on n (or, more generally, when the constant g from (1.9) fulfills g = 0), it follows that Since each extra term is divisible by the monomial γ, it follows that the contribution of the extra terms is negligible when compared to the unique original top-degree term R l+1 . It follows that in this asymptotics the relationships between the quantities (a l ), (a ′ l ) and (a ′′ l ) which provide the firstorder asymptotics of, respectively, the characters, the mean value of free cumulant, and the mean value of the functionals of shape, remain the same as in Section 3.6 for the case α = 1.
From Theorem 3.2 it follows that an analogous result holds true for the conditional cumulant (covariance) and the degree of F remains equal to l 1 + l 2 when we pass from P (1) to P. A reasoning similar to the one above implies that not only the proof of [Śni06, Theorem and Definition 1] remains valid in our context for ℓ = 2, but also the relationships between the quantities (2.6)-(2.9) which provide the first-order asymptotics of cumulants remain the same as in [Śni06, Theorem 3]. Anticipating the proof of Theorem 1.5, the above considerations imply the following explicit description of the covariance of the limiting Gaussian process ∆ ∞ .
Corollary 3.5. The covariance of the Gaussian process ∆ ∞ describing the limit fluctuations of random Young diagrams from Theorem 1.5 coincides with its counterpart for α = 1 from [Śni06, Theorem 3]. 3.7.2. The first-order asymptotics in the double scaling limit. In the asymptotics when α = α(n) depends on n in a way described in Section 1.11 with g = 0, the extra terms in both examples (3.15), (3.16) considered above are of the same order as the original terms. It follows that the relationship between the quantities (a l ), (a ′ l ) and (a ′′ l ) is altered and depends on the constant g from (1.9), see Section 3.9.2 below. Also the covariance of the Gaussian process describing the fluctuations of random Young diagrams is altered; finding an explicit form for this covariance is currently beyond our reach because no closed formula for the top-degree part of the conditional cumulant κ • (Ch l 1 , Ch l 2 ) (an analogue of the results of [Śni18, Section 1] for Ch n ) is available.
3.8. Refined asymptotics of characters. In order to find more subtle relationships between the asymptotics of various quantities appearing in Theorem 2.3 we need an analogue of Equation (3.8) between the character Ch l and the free cumulants in the generic case α = 1. We present below two such formulas: the one from Section 3.8.1 is conceptually simpler and will be sufficient for the scaling when α is fixed; in the case of the double scaling limit we will need a more involved formula from Section 3.8.2.

3.8.2.
Closed formula for top-degree part of Jack characters. Let us fix an integer l ≥ 1. We will view the symmetric group S(l) as the set of permutations of the set The group S(l − 1) acts on X l by coordinate-wise conjugation: π · (σ 1 , σ 2 ) := πσ 1 π −1 , πσ 2 π −1 .
The orbits of this action define an equivalence relation ∼ on X l ; the corresponding equivalence classes have a natural combinatorial interpretation as non-labeled, rooted, bicolored, oriented maps with l edges which is out of scope of the current paper (see [Śni18,Section 1.4

.3] for details).
For a permutation π we denote by C(π) the set of its cycles. We say that a triple (σ 1 , σ 2 , q) is an 'expander' [Śni18, Appendix A.1], see also [DFŚ10], if σ 1 , σ 2 ∈ S(l) are permutations and q : C(σ 2 ) → {2, 3, . . . } is a function on the set of cycles of σ 2 with the following two properties: and for every set A ⊂ C(σ 2 ) such that A = ∅ and A = C(σ 2 ) we have that # c ∈ C(σ 1 ) : c intersects at least one of the cycles in A > d∈A q(d) − 1 .
The following is a refined version of the formula (3.17). where the first sum runs over the representatives of the equivalence clases.
3.9.1. The scaling when α is constant. Part (b) of Theorem 2.3 concerns the trivial case ℓ = 1 which one can easily prove from scratch, based on (3.17). We shall present a detailed proof only for a specific case which will be useful in applications (more specifically, for the proof of Theorem 1.5 from Section 6) and we shall assume that the refined asymptotics of characters specified in part (b) of Theorem 2.3 holds true for the quantity (2.6). The other implications are analogous.
For a specific choice of the constants for some sequences (a l ) and (b l ), it is a simple exercise to use (2.1) and (3.17) in order to show that where (a ′ l ) is given again by (3.13) and (b ′ l ) is the unique sequence which fulfills In particular, (3.20) shows that the refined asymptotics of characters specified in part (b) of Theorem 2.3 holds true for the quantity (2.7).
Consider now the quantity under the limit symbol in (2.8) for ℓ = 1 and for the specific choice of x 1 = S l . Equation (3.6) implies that the refined asymptotics of characters specified in part (b) of Theorem 2.3 holds true for the quantity (2.8): with the constants given by (3.14) and We conclude the proof by pointing out that for ℓ = 1 the expression under the limit symbol in (2.8) coincides with its counterpart from (2.9).
Remark 3.7. One can see that generically for α = 1 and γ = 0 (even if the initial characters χ n (l) have small subleading terms which corresponds to b l ≡ 0) the subleading terms in (3.23) are much bigger than their counterparts for α = 1 from (3.12), namely they are of order 1 √ n times the leading asymptotic term. As we shall see in Section 6, this leads to noncenteredness of the limiting Gaussian process ∆ ∞ .

TECHNICAL RESULTS
This section is devoted to some technical results necessary for the proof of Theorem 1.3. 4.1. Slowly growing sequence of moments determines the measure.
Lemma 4.1. Assume that µ is a probability measure which is supported on the interval [x 0 , ∞) (respectively, on the interval (−∞, x 0 ]) for some x 0 ∈ R and such that Then the measure µ is uniquely determined by its moments.
Similarly, if the measure µ is supported on the real line R and such that (4.2) |m l | ≤ C l l l holds true for some constant C and all integers l ≥ 1, then the measure µ is uniquely determined by its moments.
Proof. In the case when µ is supported on the interval [0, ∞) this is exactly Stieltjes moment problem, while in the case when µ is supported on the real line R this is exactly the Hamburger moment problem. It is easy to check that the assumptions (4.1), and (4.2) imply that the Carleman's conditions in both Stieltjes and Hamburger, respectively, problems are satisified and it follows that the measure µ is uniquely determined by its moments. Now, assume that µ is a probability measure which is supported on the interval [x 0 , ∞). We define a probability measure µ x 0 supported on the interval [0, ∞), as a translation of µ that is, for any measurable set A ⊂ R we have µ x 0 (A) := µ(A + x 0 ). Let us compute the moments of µ x 0 : This leads to the following inequalities: By Carleman's criterion it means that the measure µ x 0 is uniquely determined by its moments, which is equivalent by the construction that the measure µ is uniquely determined by its moments, too.
The case, when µ is supported on the interval (−∞, x 0 ] is analogous, and we leave it as a simple exercise. 4.2. Slow growth of (R n ) implies slow growth of (S n ).
Lemma 4.2. Let (S l ) l≥2 be a sequence of real numbers and let (R l ) l≥2 given by (3.7) be the corresponding sequence of free cumulants. Assume that the sequence of free cumulants fulfills the estimate (4.3) |R l | ≤ C l l ml for some constants m, C ≥ 0 and all l ≥ 2.
Then the sequence (S l ) fulfills an analogous estimate (4.4) |S l | ≤ C l l ml ; possibly for another value of the constant C.
we can bound the sum on the right-hand side of (4.5) as follows: which plugged into (4.5) yields which finishes the proof.

Estimates on some classes of permutations.
Recall that for a permutation π we denote by C(π) the set of its cycles. The length π := l − |C(π)| of a permutation π ∈ S(l) is defined as the minimal number of factors necessary to write π as a product of transpositions.
Proof. We claim that for each permutation π ∈ S(l) such that π = r there exist at least r transpositions τ with the property that the permutation π ′ := πτ fulfills π ′ = π − 1. Indeed, each such a transposition is of the form τ = (a, b) with a = b being elements of the same cycle of π; it follows that the number of such transpositions is equal to By repeating inductively the same argument for the collection of permutations (π ′ ) obtained above, it follows that the permutation π can be written in at least r! different ways as a product of r transpositions. Since there are l We revisit Section 3.8.2. In the following we will need a convenient way of parametrizing the equivalence classes in X l / ∼; for this purpose we note that in each equivalence class one can choose a representative (which is not necessarily unique) (σ 1 , σ 2 ) with the property that the permutation σ 2 has a particularly simple cycle structure, namely σ 2 = (1, 2, . . . , i 1 )(i 1 + 1, i 1 + 2, . . . , i 2 ) · · · (i ℓ−1 + 1, i ℓ−1 + 2, . . . , i ℓ ) for some increasing sequence 1 ≤ i 1 < i 2 < · · · < i ℓ = l. Note that for a fixed ℓ = |C(σ 2 )| (4.6) the number of permutations σ 2 of the above form is given by l ℓ − 1 ≤ l ℓ−1 .

Growth of free cumulants.
Proposition 4.4. We use the notations and assumptions of Theorem 1.3. For the random variable R l = R l (λ n ) we define Then there exists some constant C such that (4.8) |r l | ≤ C l l ml holds true for each integer l ≥ 2, where m is given by (1.13).
Proof. For a given value of n we will investigate the collection of random variables (4.9) n − l 2 R l l≥2 .
Approximate factorization property, by Theorem 2.3(a)(C), implies (for ℓ = 1) that the limit (4.7) exists and is finite for each integer l ≥ 2. Furthermore, it implies that each cumulant κ ℓ for ℓ ≥ 2 of the random variables (4.9) converges to zero as n → ∞.
Each moment (i.e. the mean value of a product of some random variables) can be expressed as a polynomial in the cumulants of the individual random variables via "moment-cumulant formula". Thus by vanishing of the higher cumulants which correspond to ℓ ≥ 2, the expected value of a product of free cumulants approximately factorizes: (4.10) lim n→∞ 1 n k 1 +···+k ℓ 2 E χn R k 1 · · · R k ℓ = r k 1 · · · r k ℓ .
We consider first the case g = 0, m = 1. Let us divide both sides of (3.17) by n l+1 2 and take the mean value E χn . By taking the limit n → ∞ and using (4.10) we obtain in this way r l+1 = a l+1 and the claim follows immediately.
From the following on we consider the generic case g = 0 and m = 2. Analogously as above, let us divide both sides of (3.18) by n l+1 2 and take the mean value E χn . By taking the limit n → ∞ and using (4.10) we obtain in this way (4.11) We shall cluster the summands according to the parameters u and v given by In the following we will show that from the transitivity requirement in the definition of X l it follows that v ≥ 0.
Indeed, let us construct a bipartite graph G = (V • ⊔ V • , E) with the vertices corresponding to the cycles of σ 1 and the cycles of σ 2 : V • = C(σ 1 ), V • = C(σ 2 ); we connect two vertices by an edge if the corresponding cycles are not disjoint, that is e = (c 1 , c 2 ) ∈ E if c 1 ∩ c 2 = ∅. Then, the transitivity of the action of the group generated by σ 1 , σ 2 ∈ S(l) means precisely that the graph G is connected. Since the number of edges of G is bounded from above by l it follows that the number of vertices of G, which is equal to |C(σ 1 )| + |C(σ 2 )|, cannot exceed l + 1, which gives the required inequality.
Furthermore, the contribution of the terms for which the equality v = 0 holds true corresponds to the specialization g = 0; by revisiting (3.17) it follows that this contribution is equal to r l+1 which corresponds to the unique equivalence class (id, σ 2 ) : σ 2 ∈ S(l) is such that |C(σ 2 )| = 1 for which u = 0 and v = 0. It is easy to check that it is the unique summand for which u = 0 (since the latter condition is equivalent to σ 1 = id). By singling out this particular summand, (4.11) can be transformed to (4.12) With the notations used in Equation (4.12) which implies that for each C > 0 we have that (4.14) By Lemma 4.3 and (4.6), for each pair of integers u, v ≥ 1 the number of equivalence classes [(σ 1 , σ 2 )] which could possibly contribute to the above sum is bounded from above by For each representative (σ 1 , σ 2 ) of an equivalence class the number of functions q : C(σ 2 ) → {2, 3, . . . } which fulfill (4.13) is bounded from above by Our strategy is to prove (4.8) for m = 2 by induction over l ≥ 2. It is trivial to check that r 2 = 1 always holds true and thus the induction base l = 2 is valid if C ≥ 1. We shall assume that that (4.8) holds true for 2 ≤ k ≤ l. The value of the constant C will be specified at the end of the proof in such a way that each induction step can be justified. The induction hypothesis implies that We claim that the following inequality holds true: Indeed, the logarithm of the left-hand side is a convex function its supremum over the simplex given by inequalities q(c) ≥ 2 and the equality (4.13) is attained in one of the simplex vertices which corresponds to this concludes the proof of (4.15).
In this way we proved that . It follows that the right-hand side of (4.14) is bounded from above by a l+1 C l+1 (l + 1) 2(l+1) + u≥1 v≥1 The right-hand side tends to zero uniformly over l as C → ∞; there exists therefore some C such that the right-hand side is smaller than 1. Such a choice of C assures that each inductive step is justified. This concludes the proof.

LAW OF LARGE NUMBERS. PROOF OF THEOREM 1.3
For Reader's convenience the proof of Theorem 1.3 was split into several subsections which consitute the current section. 5.1. Measure associated with a Young diagram. Suppose an anisotropic Young diagram Λ ⊆ R × R (viewed in the French coordinate system) is given. We will assume that the area of Λ is equal to 1. Let (x, y) ∈ Λ be a random point in Λ, sampled with the uniform probability. We denote by P Λ the probability distribution of its Russian coordinate It is a probability measure on R with the probability density This density is a Lipschitz function with the Lipschitz constant equal to 1. Such probability measures P Λ will be our main tool for investigation of asymptotics of Young diagrams Λ. The Reader should be advised that this is not Kerov's transition measure which is also a probability measure on the real line associated with a Young diagram [Ker93b] for similar purposes. Any anisotropic Young diagram Λ with unit area which contains some point (x 0 , y 0 ), contains also the whole rectangle {(x, y) : 0 ≤ x ≤ x 0 , 0 ≤ y ≤ y 0 }; by comparison of the areas it follows that x 0 y 0 ≤ 1. The latter inequality written in the Russian coordinate system gives the following restriction on the possible values of the corresponding profile ω: and for the corresponding density A simple change of variables in the integrals shows that for a Young diagram λ n with n boxes and the corresponding anisotropic Young diagram Λ n given by (1.16) the moments of the measure P Λn are given by

Random variables S
[n] k and their convergence in probability. We start the proof of Theorem 1.3. For k ≥ 2 consider the random variable By aproximate factorization property, the condition (A) from Theorem 2.3 is fulfilled; it follows that the condition (C) is fulfilled as well. In the special case ℓ = 1 and x 1 = S k it follows that the limit k ) n converges (as n → ∞) to s k in probability.
5.3. The limiting probability measure P Λ∞ . By (5.2), for each n the mean value exists, is finite, and fulfills analogous bounds to (5.2). It is the density of the probability measure EP Λn ; the moments of this measure are given by k+2 .
The topology on the set of probability measures (with all moments finite) given by convergence of moments can be metrized; we denote by d the corresponding distance. Equation (5.3) implies that the sequence of measures (EP Λn ) is a Cauchy sequence in the metric space given by d; this sequence converges therefore in moments to some probability measure which will be denoted by P Λ∞ , in particular u k dP Λ∞ (u) = 1 k + 1 s k+2 .
In general, it might happen that the measure P Λ∞ is not unique; it turns out, however, that in the setup which we consider the measure P Λ∞ is uniquely determined by its moments; we shall prove it in the following. 5.4. The measure P Λ∞ is determined by its moments. By a minor modification of the proof of (4.10) we have It follows that the relation between the families of real numbers (s k ) k≥2 and (r k ) k≥2 (given by (4.7)) is given by an analogue of (3.7). Proposition 4.4 states that there exists some constant C such that |r k | ≤ C k k mk for all positive integers k ≥ 2, where m is given by (1.13). Thus Lemma 4.2 gives us the following estimates for the moments of P Λ∞ : u k dP Λ∞ (u) = 1 k + 1 s k+2 ≤ C ′k+2 (k + 2) m(k+2) ≤ C ′′k k mk for some constants C ′ , C ′′ .
We consider first the case g = 0. Lemma 4.1 implies immediately that the measure P Λ∞ is uniquely determined by its moments which concludes the proof.
In the case g > 0 the height of each box constituting the anisotropic Young diagram Λ n is equal to g + o(1) > c for some constant c > 0, uniformly over n, cf. Section 1.11. By comparison of the areas it follows that the length l of the bottom rectangle constituting Λ n fulfills lc ≤ 1; in particular it follows that the support of the measure P Λn is contained in the interval −∞, 1 c . It follows that an analogous inclusion holds true for the support of the mean value EP Λn ; by passing to the limit the same is true for P Λ∞ . It follows that Lemma 4.1 can be applied which concludes the proof.
The case g < 0 is fully analogous. 5.5. Weak convergence of probability measures implies uniform convergence of densities. For ǫ > 0 and u 0 ∈ R let φ ǫ : R → R + be a function on the real line such that φ ǫ is supported on an ǫ-neighborhood of u 0 and φ ǫ (u) du = 1. Since Ef Λn is Lipschitz with constant 1, it follows that By weak convergence of probability measures, the integral on the left-hand side converges, as n → ∞, to φ ǫ (u) dP Λ∞ (u). By passing to the limit, the above inequality implies therefore that lim sup n→∞ Ef Λn (u 0 ) − φ ǫ (u) dP Λ∞ (u) ≤ ǫ.
Since this inequality holds true for arbitrary ǫ > 0, it follows that the sequence Ef Λn (u 0 ) is a Cauchy sequence, hence it converges to a finite limit which will be denoted by f Λ∞ (u 0 ). In other words, we have proved that the functions Ef Λn converge pointwise to the function f Λ∞ ; since all functions Ef Λn are Lipschitz with the same constant, the convergence is uniform on a compact set K = [−R, R] for arbitrary value of R.
On the other hand, inequalities (5.2) show that the distance between Ef Λn and f Λ∞ with respect to the supremum norm on the set K c = R \ K is bounded by (5.7) Ef Λn − f Λ∞ L ∞ [K c ] ≤ 2 √ R 2 + 4 + |R| .
Since the right-hand side converges to zero as R → ∞, it follows that the sequence of functions Ef Λn converges to f Λ∞ uniformly on the whole real line R.
To conclude, we proved the following theorem which might be of independent interest.
Theorem 5.1. Let (Λ n ) be a sequence of random anisotropic Young diagrams, each with the unit area. Let (P Λn ) be the corresponding sequence of random probability measures on R with densities (f Λn ) as in Section 5.1. Assume that the sequence of probability measures (EP Λn ) converges to some limit in the weak topology.
Then there exists a function f Λ∞ such that Ef Λn → f Λ∞ uniformly on R.
5.6. Convergence of densities, in probability. We have proved that the sequence of random variables (S

[n]
k ) n converges (as n → ∞) to s k in probability; in other words for each ǫ > 0 and each integer k ≥ 0 (5.8) lim n→∞ P u k dP Λn (u) − u k dP Λ∞ (u) > ǫ = 0; in other words the sequence of random probability measures P Λn converges to the measure P Λ∞ in moments, in probability.
The weak topology of probability measures can be metrized, for example by Lévy-Prokhorov distance π. Since the measure P Λ∞ is uniquely determined by its moments, convergence to P Λ∞ in moments implies convergence to the same limit in the weak topology of probability measures. With the help of the distances d (cf. Section 5.3) and π, the latter statement can be rephrased as follows: for each ε > 0 there exists δ > 0 such that for any probability measure µ d(µ, P Λ∞ ) < δ =⇒ π(µ, P Λ∞ ) < ε.
It follows that the sequence of random probability measures P Λn converges to the measure P Λ∞ in the weak topology of probability measures, in probability, i.e. for each ε > 0 (5.9) lim n→∞ P π(P Λn , P Λ∞ ) > ε = 0.
As ǫ ց 0, the integral φ ǫ (u) dP Λ∞ (u) converges to the density f Λ∞ (u 0 ) by an analogue of (5.6). In this way we proved that for each u 0 the sequence f Λn (u 0 ) converges to f Λ∞ (u 0 ) in probability.
By the same type of argument as in (5.7) it follows that the sequence of functions f Λn converges uniformly to f Λ∞ in probability, i.e. for each ǫ > 0 lim n→∞ P f Λn − f Λ∞ ∞ > ǫ = 0 with respect to the supremum norm. 5.7. Back to Young diagrams. The function ω Λ∞ which was promised in the formulation of Theorem 1.3 is simply given by the relationship (5.1) for the specific choice of f Λ := f Λ∞ , namely ω Λ∞ (u) := 2f Λ∞ (u) + |u|.
We just finished the proof of the fact that ω Λn converges to ω Λ∞ in the supremum norm as n → ∞, in probability, thus the proof of Theorem 1.3 is completed.
6. CENTRAL LIMIT THEOREM. PROOF OF THEOREM 1.5 Proof of Theorem 1.5. In the light of Remark 1.6 we shall investigate the cumulants of the form κ ℓ Y i 1 , . . . , Y i ℓ for the random variables (Y k ) given by (1.18).
We start with the case ℓ ≥ 2. By (1.17), each Y k is equal (up to a deterministic shift) to the random variable X k := √ n k − 1 2 u k−2 ω Λn (u) du = n − k−1 2 S k (λ n ).
Consider now the case ℓ = 2. If we adapt the above reasoning, we get that the limit lim exists and is finite.
We consider now the case ℓ = 1. By Theorem 2.3(b), enhanced approximate factorization property implies that for each k ≥ 2 there exist constants a ′′ k , b ′′ k such that as n → ∞. It follows that the cumulant converges as n → ∞ to b ′′ k (given explicitly by (3.24)).
Let us summarize the above discussion. We have proved that the limit lim n→∞ κ ℓ Y i 1 , . . . , Y i ℓ exists and is finite for any choice of ℓ ≥ 1 and i 1 , . . . , i ℓ ≥ 2. In other words: the joint distribution of the random variables (Y i ) converges in moments as n → ∞ to the joint distribution of an abstract family of random variables (Z i ) with the property that all cumulants vanish: κ ℓ Z i 1 , . . . , Z i ℓ = 0, except for ℓ ≤ 2. The latter is the defining property of the Gaussian distribution. Since the Gaussian distribution is uniquely determined by its moments, it follows that (Y i ) converges to (Z i ) not only in moments but also in the weak topology of probability measures, as required.