on the error bound in the normal approximation for jack
play

On the Error Bound in the Normal Approximation for Jack Measures - PowerPoint PPT Presentation

On the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh) Louis H. Y. Chen National University of Singapore International Colloquium on Steins Method, Concentration Inequalities, and Malliavin Calculus


  1. On the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh) Louis H. Y. Chen National University of Singapore International Colloquium on Stein’s Method, Concentration Inequalities, and Malliavin Calculus June 29 - July 2 2014 Chˆ ateau de la Bretesche Missillac, Loire-Atlantique, France L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 1 / 32

  2. Outline Partitions of positive integers Young diagram and Young Tableau Plancherel measure Normal approximation for Character Ratios Jack measures Normal Approximation for Jack Measures Main Theorems Zero-bias Coupling Rosenthal Inequality for Zero-bias Coupling Normal Approximation for Zero-bias Coupling Zero-bias Coupling for Jack Measures Sketch of Proof of Main Theorems Summary L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 2 / 32

  3. Partitions of Positive Integers A partition of a positive integer n is a finite non-increasing sequence of positive integers λ 1 ≥ λ 2 ≥ · · · ≥ λ l > 0 such that l � λ i = n . Write λ = ( λ 1 , λ 2 , . . . , λ l ) . i =1 The λ i are called the parts of the partition λ and the number l of parts called the the length of λ . We write λ ⊢ n to denote ” λ is a partition of n ”. Denote that set of all partitions of n by P n and the set of all partitions by P , that is, P = � ∞ n =0 P n . By convention, the empty sequence forms the only partition of zero. L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 3 / 32

  4. Partitions of Positive Integers Let p ( n ) be the partition function, that is, the number of partitions of n . An important and fundamental question is to evaluate p ( n ) . Euler started the analytic theory of partitions by providing an explicit formula for the generating function of p ( n ) : ∞ ∞ 1 p ( n ) q n = � � F ( q ) := 1 − q k . n =0 k =1 In a celebrated series of memoirs published in 1917 and 1918, Hardy and Ramanujan established: 3 e π √ 2 1 3 n (1 + O ( 1 p ( n ) = √ √ n ) . 4 n L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 4 / 32

  5. Young Diagram To each partition λ = ( λ 1 , λ 2 , . . . , λ l ) is associated its Young diagram (shape). λ 1 λ 2 λ l L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 5 / 32

  6. Young Tableau A standard Young tableau T with the shape λ ⊢ n is a one-to-one assignment of the numbers 1 , 2 , . . . , n to the squares of λ in such a way that the numbers increase along the rows and down the columns. See, for example, n = 9 . λ 1 1 3 4 7 λ 2 2 5 6 8 λ l 9 Let d λ denote the total number of standard Young tableaux associated with a given shape λ . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 6 / 32

  7. Plancherel Measure The set of irreducible representations of the symmetric group S n of permutations of 1 , 2 , . . . , n can be parameterized by λ ∈ P n . The degree (dimension) of the irreducible representation indexed by λ is equal to d λ . The Burnside identity is: d 2 � � d 2 λ λ = n ! ( that is , n ! = 1) . λ ⊢ n λ ⊢ n The Plancherel measure is a probability measure on λ ⊢ n (also on the irreducible representations of S n , parameterized by λ ) given by: P ( { λ } ) = d 2 λ n ! . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 7 / 32

  8. Plancherel Measure The first row of a random partition distributed according to the Plancheral measure has the same distribution as the longest increasing subsequence of a random permutation distributed according to the uniform measure. Let l ( π ) be the length of the longest increasing subsequence of the random permutation π . It is knwon that ( l ( π ) − 2 √ n ) /n 1 / 6 converges to the Tracy-Widom distribution. (Baik, Deift and Johansson (1999), J. Amer. Math. Soc.) L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 8 / 32

  9. Character Ratio The character of a group representation is a function on the group that associates to each group element the trace of the corresponding matrix. It is called irreducible if it is the character of an irreducible representation. Let χ λ (12) be the irreducible character parametrized by λ evaluated on the transposition (12). The quantity χ λ (12) is called a character ratio. d λ The eigenvalues for the random walk on the symmetric group generated by transpositions are the character ratios χ λ (12) /d λ , each occcuring with multipicity d 2 λ . Diaconis and Shahshahani (1981), Z. Wahr. Verw. Gebiete . Character ratios also play an essential role in work on the moduli spaces of curves (see Eskin and Okounkov (2001), Invent. Math. and Okounkov and Pandharipande (2005), Proc. Sympos. Pure Math., 80, Part 1, Amer. Math. Soc. ). L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 9 / 32

  10. Normal Approximation for Character Ratios Let �� n � χ λ (12) W n = 2 d λ and let Φ be the N (0 , 1) distribution function. Assume n ≥ 2 and let x ∈ R . Kerov (1993), Compt. Rend. Acad. Sci. Paris. L − → N (0 , 1) as n − → ∞ . W n Fulman (2005), Trans. AMS (using Stein’s method) | P ( W n ≤ x ) − Φ( x ) | ≤ 40 . 1 n − 1 / 4 . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 10 / 32

  11. Normal Approximation for Character Ratios Fulman (2006) Trans. AMS (using martingales) | P ( W n ≤ x ) − Φ( x ) | ≤ Cn − s for any s < 1 / 2 . Shao and Su (2006), Proc. AMS (using Stein’s method) | P ( W n ≤ x ) − Φ( x ) | ≤ Cn − 1 / 2 . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 11 / 32

  12. Jack Measures The Jack α measure, α > 0 , is a probaility measure on λ ⊢ n given by: α n n ! Jack α ( λ ) = x ∈ λ ( αa ( x ) + l ( x ) + 1)( αa ( x ) + l ( x ) + α ) , � where in the product over all boxes x in the partition λ , (i) a ( x ) denotes the number of boxes in the same row of x and to the right of x (the ”arm” of x ), (ii) l ( x ) denotes the number of boxes in the same column of x and below x (the ”leg” of x ). L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 12 / 32

  13. Jack Measures For example, take n = 5 and λ as shown below. λ = α n n ! Jack α ( λ ) = � x ∈ λ ( αa ( x ) + l ( x ) + 1)( αa ( x ) + l ( x ) + α ) 60 α 2 = (2 α + 2)(3 α + 1)( α + 2)(2 α + 1)( α + 1) . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 13 / 32

  14. Jack Measures The Jack α measure with α = 2 /β is a discrete analog of Dyson’s β ensembles in random matrix theory, which are tractable for β = 1 , 2 , 4 . The joint probability density for the eigenvalues x 1 ≥ x 2 ≥ · · · ≥ x n of the Gaussian orthogonal ensemble (GOE), Gaussian unitary ensemble (GUE) and Gaussian symplectic ensemble(GSE) is given by − x 2 1 + · · · + x 2 1 � � n Π 1 ≤ i<j ≤ n ( x i − x j ) β exp Z β 2 for β = 1 , 2 , 4 respectively. The Jack α measure with α (= 2 /β ) = 2 , 1 , 1 / 2 has group theoretical interpretation. L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 14 / 32

  15. Jack Measures In the case α = 1 , α n n ! Jack α ( λ ) = � x ∈ λ ( αa ( x ) + l ( x ) + 1)( αa ( x ) + l ( x ) + α ) n ! = x ∈ λ h 2 ( x ) , � where h ( x ) = a ( x ) + l ( x ) + 1 is the hook length of the box x . The hook-length formula states that n ! d λ = x ∈ λ h ( x ) . � Hence the Plancherel measure can be expressed as P ( { λ } ) = d 2 n ! λ n ! = x ∈ λ h 2 ( x ) , � which agrees with the Jack α measure for α = 1 . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 15 / 32

  16. Normal Approximation for Jack Measures Let � �� � λ i � λ ′ � � α − i i 2 2 W n,α = W n,α ( λ ) = , � � n � α 2 where the partition λ ⊢ n is chosen according to the Jack α measure, λ i is the length of the i th row of λ and λ ′ i the length of the i th column of λ . If α = 1 , �� n � χ λ (12) W n,α = 2 d λ by the Frobenius formula. L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 16 / 32

  17. Normal Approximation for Jack Measures Assume n ≥ 2 and let x ∈ R . Fulman (2004), J. Comb. Theory Ser. A For α ≥ 1 , | P ( W n,α ≤ x ) − Φ( x ) | ≤ C α n 1 / 4 . He conjectured that for α ≥ 1 , the optimal bound is a univeral √ α constant multiplied by max { 1 √ n, n } . Fulman (2006) Trans. AMS (using martingales) For α ≥ 1 , C α | P ( W n,α ≤ x ) − Φ( x ) | ≤ for any ǫ > 0 . n 1 / 2 − ǫ L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 17 / 32

  18. Normal Approximation for Jack Measures Fulman (2006), Ann. Comb. (using Stein’s method) For α ≥ 1 , | P ( W n,α ≤ x ) − Φ( x ) | ≤ C α n 1 / 2 . Fulman and Goldstein (2011), Comb. Probab. Comput. (using Stein’s method and zero-bias coupling) For α > 0 , � � � � 2 2 + max( α, 1 /α ) � F − Φ � 1 ≤ 2 + , n n − 1 where F ( x ) = P ( W n,α ≤ x ) . L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 18 / 32

  19. Main Theorems Chen and Thanh (2014), Preprint Theorem 1 For α > 0 , √ n, max {√ α, 1 / √ α } log n � 1 � sup | P ( W n,α ≤ x ) − Φ( x ) | ≤ 9max . n x ∈ R Remarks. 1. For α = 1 , the theorem reduces to one for character ratios under 9 the Plancherel measure with the bound √ n , where the constant is explicit. √ α log n � 1 � 2. For α ≥ 1 , the bound becomes 9max √ n, , which is n close to that conjectured by Fulman (2004). L. H. Y. Chen (NUS) Jack Measures Stein Colloquium 19 / 32

Recommend


More recommend