Central Limit Theorems for linear statistics for Biorthogonal Ensembles
|
|
- Roderick Watson
- 6 years ago
- Views:
Transcription
1 Central Limit Theorems for linear statistics for Biorthogonal Ensembles Maurice Duits, Stockholm University Based on joint work with Jonathan Breuer (HUJI) Princeton, April 2, 2014 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
2 Linear statistic Given a function f : R R and random points x 1,..., x n R the linear statistic X n (f ) is defined as X n (f ) = n f (x j ) j=1 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
3 Linear statistic Given a function f : R R and random points x 1,..., x n R the linear statistic X n (f ) is defined as X n (f ) = n f (x j ) j=1 In this talk we will be discussing asymptotic behavior as n of the fluctuations of X n (f ) where 1 x 1,..., x n are random from a biorthogonal ensembles with a recurrence (so β = 2) 2 f C 1 (R) with at most polynomial growth at ±. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
4 Central Limit Theorems Typically, there exists a limiting distribution ν of points as n, and we have, almost surely, 1 n X n(f ) = 1 n n f (x j ) f (x)dν(x) j=1 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
5 Central Limit Theorems Typically, there exists a limiting distribution ν of points as n, and we have, almost surely, 1 n X n(f ) = 1 n n f (x j ) f (x)dν(x) j=1 In several important examples it has been proved that the fluctuations X n (f ) EX n (f ) satisfy a Central Limit Theorem for some σ(f ) 2. X n (f ) EX n (f ) N(0, σ(f ) 2 ), as n, M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
6 Central Limit Theorems Typically, there exists a limiting distribution ν of points as n, and we have, almost surely, 1 n X n(f ) = 1 n n f (x j ) f (x)dν(x) j=1 In several important examples it has been proved that the fluctuations X n (f ) EX n (f ) satisfy a Central Limit Theorem for some σ(f ) 2. X n (f ) EX n (f ) N(0, σ(f ) 2 ), as n, No normalization, since f C 1 (R). In particular, the variance has a limit. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
7 Example: Unitary ensembles Consider the probability measure on R n defined by 1 Z n 1 i<j n (x i x j ) 2 e n n j=1 V (x j ) dx 1 dx n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
8 Example: Unitary ensembles Consider the probability measure on R n defined by 1 Z n 1 i<j n (x i x j ) 2 e n n j=1 V (x j ) dx 1 dx n. As n there is a limiting density of points µ V, which is the unique minimizer of 1 log x y dν(x)dν(y) + V (x)dν(x) among all probability measures ν on R. Hence 1 n X n(f ) f (x)dµ V (x), almost surely as n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
9 Example: Unitary ensembles Theorem (Johansson 98) Under certain assumptions on V, in particular S(µ V ) = [γ, δ], we have that for sufficiently smooth f X n (f ) EX n (f ) N(0, in distribution as n, where f k = 1 2π ( δ γ f 2πi 2 0 k f k 2 ) k=1 cos θ + δ + γ ) e ikθ dθ. 2 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
10 Example: Unitary ensembles Some history Polynomial V, one-cut case and f H 2+ε for some ε > 0 (+additional assumptions) Johansson 98 Techniques were extended in Shcherbina-Kriecherbauer 10 Borot-Guionnet 12 to allow real analytic V. The one-cut assumption is essential. In multi-cut case there is not necessarily a limit to a Gaussian Pastur 06. In the multicut case, full asymptotic expansions of the partition function were recently obtained in Shcherbina 13, Borot-Guionnet 13. These results extend (with some appropriate modifications) to β-ensembles, but in this talk we assume β = 2. Other classical ensembles have been studied: e.g.β-jacobi ensembles Dumitriu-Paquette 12,Borodin-Gorin 13. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
11 Example: Lozenge tilings b c. Tilings of the abc-hexagon with lozenges a M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
12 Example: Lozenge tilings b c. Tilings of the abc-hexagon with lozenges a M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
13 Example: Lozenge tilings b c. Tilings of the abc-hexagon with lozenges a Random tilings: take uniform measure on all possible tilings M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
14 Example: Lozenge tilings M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
15 Gaussian Free Field To each tiling one associates a height function, whose graph is a stepped surface. The pairing of the random height function with a test function gives a linear statistic. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
16 Gaussian Free Field To each tiling one associates a height function, whose graph is a stepped surface. The pairing of the random height function with a test function gives a linear statistic. In many recent works these 2 dimensional fluctuations of the height function turn out ot be described by the Gaussian Free Field (+ complex structure). Borodin, Borodin-Bufetov, Borodin-Gorin, Borodin-Ferrari, D., Kenyon, Kuan, Petrov, M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
17 Gaussian Free Field To each tiling one associates a height function, whose graph is a stepped surface. The pairing of the random height function with a test function gives a linear statistic. In many recent works these 2 dimensional fluctuations of the height function turn out ot be described by the Gaussian Free Field (+ complex structure). Borodin, Borodin-Bufetov, Borodin-Gorin, Borodin-Ferrari, D., Kenyon, Kuan, Petrov, The example of lozenge tilings of a hexagon has been a special case in Petrov 13. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
18 Gaussian Free Field To each tiling one associates a height function, whose graph is a stepped surface. The pairing of the random height function with a test function gives a linear statistic. In many recent works these 2 dimensional fluctuations of the height function turn out ot be described by the Gaussian Free Field (+ complex structure). Borodin, Borodin-Bufetov, Borodin-Gorin, Borodin-Ferrari, D., Kenyon, Kuan, Petrov, The example of lozenge tilings of a hexagon has been a special case in Petrov 13. For the purpose of this talk, the main interest is in the 1-d fluctuations... M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
19 Example: Lozenge tilings M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
20 Example: Lozenge tilings s M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
21 Example: Lozenge tilings s. The centers x 1..., x n of the red tiles at a vertical line at distance s of the left side, have the jpdf on N n 1 i<j n n (x i x j ) 2 w(x j ), j=1 where w is the Hahn weight (with an appropriate choice of parameters). Johansson 02. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
22 Example: Lozenge tilings s. The centers x 1..., x n of the red tiles at a vertical line at distance s of the left side, have the jpdf on N n 1 i<j n n (x i x j ) 2 w(x j ), j=1 where w is the Hahn weight (with an appropriate choice of parameters). Johansson 02. Fluctuations: X n (f ) EX n (f ) N(0, σ 2 f ) in distribution as n. (1-d section of the GFF+complex structure) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
23 The previous two models (the Unitary Enembles and vertical sections of lozenge tilings of a hexagon) are both examples of orthogonal polynomial ensembles. We will show that the CLT s for these models are special cases of a more general CLT for such ensembles. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
24 Orthogonal Polynomial Ensembles M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
25 Orthogonal polynomial ensembles Let µ be a Borel measure on R with finite moments x k dµ(x) <. Then the Orthogonal Polynomial Ensemble of size n associated to µ is the probability measure on R n proportional to (x i x j ) 2 dµ(x 1 ) dµ(x n ). 1 i<j n M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
26 Orthogonal polynomial ensembles Let µ be a Borel measure on R with finite moments x k dµ(x) <. Then the Orthogonal Polynomial Ensemble of size n associated to µ is the probability measure on R n proportional to (x i x j ) 2 dµ(x 1 ) dµ(x n ). 1 i<j n We allow for varying measures µ = µ n (but both varying and nonvarying will be discussed) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
27 Orthogonal polynomial ensembles Let µ be a Borel measure on R with finite moments x k dµ(x) <. Then the Orthogonal Polynomial Ensemble of size n associated to µ is the probability measure on R n proportional to (x i x j ) 2 dµ(x 1 ) dµ(x n ). 1 i<j n We allow for varying measures µ = µ n (but both varying and nonvarying will be discussed) We want to find minimal conditions on the measure µ such that we have for f C 1 (R). X n (f ) EX n (f ) N(0, σ(f ) 2 )) as n, M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
28 Orthogonal polynomials We let p k,n be the orthogonal polynomial of degree k with respect to µ(= µ n ), i.e. Three term recurrence p k,n (x)p l,n (x)dµ(x) = δ kl xp k,n (x) = a k,n p k+1,n (x) + b k,n p k,n (x) + a k 1,n p k 1,n (x) Let J be the Jacobi operator corresponding to µ. b 0,n a 0,n J = J (n) a 0,n b 1,n a 1,n =. a ,n... M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
29 Reproducing kernel The reproducing kernel is defined as n 1 K n (x, y) = p k,n (x)p k,n (y) k=0 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
30 Reproducing kernel The reproducing kernel is defined as n 1 K n (x, y) = p k,n (x)p k,n (y) k=0 It satisfies the reproducing property K n (x, y)k n (y, z)dµ(y) = K n (x, z). In other words, K n as a operator on L 2 (µ) is an orthogonal projection, i.e. K n = K n and K 2 n = K n, of rank n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
31 Reproducing kernel The reproducing kernel is defined as n 1 K n (x, y) = p k,n (x)p k,n (y) k=0 It satisfies the reproducing property K n (x, y)k n (y, z)dµ(y) = K n (x, z). In other words, K n as a operator on L 2 (µ) is an orthogonal projection, i.e. K n = K n and K 2 n = K n, of rank n. Christoffel-Darboux formula: p n,n (x)p n 1,n (y) p n,n (y)p n 1,n (x) K n (x, y) = a n,n. x y M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
32 Determinantal point process The Orthogonal Polynomial Ensemble of size n associated to a Borel measure µ is a determinantal point process on R with kernel K n and reference measure µ. This means that ) E [exp tx n (f )] = det (I + (e tf 1)K n L 2 (µ) where the right-hand side is the Fredholm determinant for operator with integral kernel (e tf (x) 1)K n (x, y) acting on L 2 (µ). M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
33 A first question We recall that we ask whether we have a Central Limit Theorem where X n (f ) EX n (f )? N(0, σ(f ) 2 ) X n (f ) = n f (x j ), where f is sufficiently smooth and x 1,..., x n are from the OPE of size n for a Borel measure µ(= µ n ) on R. Question: can we expect this to hold for general measures µ? Do we have the correct normalization or does the normalization depend on regularity properties of µ? j=1 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
34 Concentration inequality Theorem (Breuer-D 13) For a bounded function f we have [ E e t(xn(f ) EXn(f )] exp(a t 2 Var X n (f )), t 1 3 f where A is a universal constant. And hence ( ( ε 2 )) P ( X n (f ) EX n (f ) ε) 2 exp min 4A Var X n (f ), ε 6 f M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
35 Concentration inequality Theorem (Breuer-D 13) For a bounded function f we have [ E e t(xn(f ) EXn(f )] exp(a t 2 Var X n (f )), t 1 3 f where A is a universal constant. And hence ( ( ε 2 )) P ( X n (f ) EX n (f ) ε) 2 exp min 4A Var X n (f ), ε 6 f The theorem holds for any determinantal process that has a kernel K n that is an orthogonal projection, i.e. K n = K 2 n and K n = K n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
36 Concentration inequality There is always the crude bound VarX n (f ) = n f 2. With the concentration inequality this implies 1 n 1/2+ε (X n(f ) EX n (f )) 0, almost surely as n for any bounded f and ε > 0. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
37 Concentration inequality There is always the crude bound VarX n (f ) = n f 2. With the concentration inequality this implies 1 n 1/2+ε (X n(f ) EX n (f )) 0, almost surely as n for any bounded f and ε > 0. In particular, if 1 n EX n(f ) has limit, then 1 n X n(f ) converges to the same limit almost surely. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
38 Concentration inequality There is always the crude bound VarX n (f ) = n f 2. With the concentration inequality this implies 1 n 1/2+ε (X n(f ) EX n (f )) 0, almost surely as n for any bounded f and ε > 0. In particular, if 1 n EX n(f ) has limit, then 1 n X n(f ) converges to the same limit almost surely. No conditions on µ! This holds for general DPP with orthogonal projection as a kernel. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
39 Concentration inequality There is always the crude bound VarX n (f ) = n f 2. With the concentration inequality this implies 1 n 1/2+ε (X n(f ) EX n (f )) 0, almost surely as n for any bounded f and ε > 0. In particular, if 1 n EX n(f ) has limit, then 1 n X n(f ) converges to the same limit almost surely. No conditions on µ! This holds for general DPP with orthogonal projection as a kernel. The bound on the variance can be improved significantly for C 1 functions. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
40 Computing the variance Compute the variance of a linear statistic VarX n (f ) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
41 Computing the variance Compute the variance of a linear statistic VarX n (f ) = f (x) 2 K n (x, x)dµ(x) f (x)f (y)k n (x, y) 2 dµ(x)dµ(y) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
42 Computing the variance Compute the variance of a linear statistic VarX n (f ) = f (x) 2 K n (x, x)dµ(x) f (x)f (y)k n (x, y) 2 dµ(x)dµ(y) = 1 (f (x) f (y)) 2 K n (x, y) 2 dµ(x)dµ(y) 2 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
43 Computing the variance Compute the variance of a linear statistic VarX n (f ) = f (x) 2 K n (x, x)dµ(x) f (x)f (y)k n (x, y) 2 dµ(x)dµ(y) = 1 (f (x) f (y)) 2 K n (x, y) 2 dµ(x)dµ(y) 2 ( ) f (x) f (y) 2 (x y) 2 K n (x, y) 2 dµ(x)dµ(y) = 1 2 x y M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
44 Computing the variance Compute the variance of a linear statistic VarX n (f ) = f (x) 2 K n (x, x)dµ(x) f (x)f (y)k n (x, y) 2 dµ(x)dµ(y) = 1 (f (x) f (y)) 2 K n (x, y) 2 dµ(x)dµ(y) 2 = 1 ( ) f (x) f (y) 2 (x y) 2 K n (x, y) 2 dµ(x)dµ(y) 2 x y ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
45 Lipschitz functions If f is a Lipschitz function, i.e. f L = sup x,y f (x) f (y) x y <, then VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
46 Lipschitz functions If f is a Lipschitz function, i.e. f L = sup x,y f (x) f (y) x y <, then VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y a2 n,n f 2 L 2 (p n (x)p n 1 (y) p n (y)p n 1 (x)) 2 dµ(x)dµ(y) = f 2 La 2 n,n M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
47 Lipschitz functions If f is a Lipschitz function, i.e. f L = sup x,y f (x) f (y) x y <, then VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y a2 n,n f 2 L 2 (p n (x)p n 1 (y) p n (y)p n 1 (x)) 2 dµ(x)dµ(y) = f 2 La 2 n,n Hence if we have a n,n = O(1) as n, then the variance remains bounded. Pastur 06 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
48 Lipschitz functions If f is a Lipschitz function, i.e. f L = sup x,y f (x) f (y) x y <, then VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y a2 n,n f 2 L 2 (p n (x)p n 1 (y) p n (y)p n 1 (x)) 2 dµ(x)dµ(y) = f 2 La 2 n,n Hence if we have a n,n = O(1) as n, then the variance remains bounded. Pastur 06 Conclusion: if f is Lipschitz and a n,n = O(1) as n, then X n (f ) EX n (f ) 1, and we have exponential tails uniformly in n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
49 Polynomial test functions Recall the formula for the variance: VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
50 Polynomial test functions Recall the formula for the variance: VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y If is a polynomial, the variance can be written in terms of finitely many recurrence coefficients a n+k,n and b n+k,n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
51 Polynomial test functions Recall the formula for the variance: VarX n (f ) ( ) = a2 n,n f (x) f (y) 2 (p n (x)p n 1(y) p n (y)p n 1(x)) 2 dµ(x)dµ(y) 2 x y If is a polynomial, the variance can be written in terms of finitely many recurrence coefficients a n+k,n and b n+k,n. In particular, For k Z we have that a n+k,n and b n+k,n have a limit as n = VarX n (f ) has a limit for any polynomial f M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
52 CLT for Orthogonal Polynomial Ensembles Theorem (Breuer-D 13) Assume that for any k Z we have a n+k,n a b n+k,n b as n. Then, if f is a polynomial with real coefficients, ( ) X n (f ) EX n (f ) N 0, k ^f k 2 k=1 where ^f k = 1 2π 2π 0 f (2a cos θ + b)e iθk dθ. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
53 CLT for Orthogonal Polynomial Ensembles Theorem (Breuer-D 13) Assume that there exists a subsequence {n j } j such that for any k Z we have a nj +k,n j a b nj +k,n j b as j. Then, if f is a polynomial with real coefficients, ( ) X nj (f ) EX nj (f ) N 0, k ^f k 2 k=1 where ^f k = 1 2π 2π 0 f (2a cos θ + b)e iθk dθ. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
54 Central Limit Theorems for C 1 functions Theorem (Breuer-D 13) Suppose there is a compact E R such that for k N we have x k K n (x, x)dµ(x) = o(1/n), R\E as n. Then the CLT holds for any f C 1 (R) such that f (x) C(1 + x k ) for some C > 0 and k N. Corollary If µ is non-varying and has compact support S(µ), then the CLT holds for any f C 1 (S(µ)). M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
55 Examples 1a and 1b Unitary Ensembles. Absolutely continuous measure with S(µ V ) = [γ, δ]. dµ n (x) = e nv (x) dx. Lozenge tiling of the hexagon. Discrete measure: dµ = N x=0 ( α + x x ) ( ) β + N x δ N x x. This called the Hahn weight and the orthogonal polynomials are the Hahn polynomials. In both cases one can prove that, with given parameters, the recurrence coefficients have limits and the CLT follows from the general CLT. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
56 Example 2 The following result for the non-varying situation follows by combining the CLT with a theorem by Denissov and Rakhmanov. Theorem Fix dµ = w(x)dx + dµ sing, and assume that S ess (µ) = [γ, δ] and w(x) > 0 Lebesgue a.e. on [γ, δ]. Then for any f C 1 (R) we have X n (f ) EX n (f ) N(0, k f k 2 ) k=1 where ^f k = 1 2πi 2π 0 f ( δ γ 2 cos θ + δ + γ ) e ikθ dθ. 2 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
57 Example 3: different CLT s for different subsequences! Partition N into blocks A 1, B 2, A 2, B 2,... such that and set b n = 0 and A j = 2 j2, B j = 3 j2. a n = { 1, n A j 1 2, n B j Then the spectral measure µ for J is supported on [ 2, 2] and is singular with respect to the Lebesgue measure. For the OPE for µ one can show that 1 n X n(f ) f (x)dµ eq (x) where µ eq is the equilibrium measure for the interval [ 2, 2]. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
58 Example 3: different CLT s for different subsequences! Hence the exists subsequence n j such that where X nj (f ) EX nj (f ) N(0, ^f k = 1 2π 2π 0 k ^f k 2 ) k=1 f (cos θ)e ikθ dθ. There also exists subsequences n j such that X n j (f ) EX n j (f ) N(0, k f k 2 ) k=1 where f k = 1 2π 2π 0 f (2 cos θ)e ikθ dθ. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
59 Example 4 Example 3 can be modified such that the spectral measure is absolutely continuous on [ 1, 1] and purely singular on [ 2, 2] \ ( 1, 1) and b n = 0 and the a n are such that for each a [ 1 2, 1] there exists a subsequence {n j (a)} j such that k Z a nj (a)+k a, as j. Hence for each a there is an CLT for a special subsequence and each CLT is different. We stil have 1 lim n n X n(f ) = f (x)dµ eq (x) where µ eq is the equilibrium measure for the interval [ 2, 2]. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
60 Right Limits M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
61 Some notation Let J be the Jacobi operator corresponding to µ. b 0,n a 0,n J = J (n) a 0,n b 1,n a 1,n =. a ,n... Tri-diagonal semi-infinite. Since we allow varying measures, we allow J to depend on n and write J = J (n). Given a Laurent polynomial s(z) = p j= q s jz j, the Laurent matrix/operator L(s) and Toeplitz matrix/operator T (s) are defined as (L(s)) k,l = s k l, k, l Z. (T (s)) k,l = s k l, k, l N. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
62 Right limits Definition A two-sided infinte matrix J R is call a right limit of {J (n) } n iff there exists a subsequence {n j } j such that ( J R) = lim J (n j ) k,l j n j +k,n j +l, k, l Z. Example: there exists a subsequence n j such that for all k we have a nj +k,n j a and b nj +k,n j b if and only if L(az + b + a/z) is a right limit of {J (n) } n. Right limits have proved to be very useful when studying the spectra of Jacobi operators Last-Simon 99, Last-Simon 06, Remling 11 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
63 Laurent matrices as right limits In this way, we can reformulate the CLT for OPE: Theorem (Breuer-D 13) Suppose that L(s) is a right limit of J (n) with subsequence {n j } j. Then, for any polynomial f with real coefficients, ( ) X nj (f ) EX nj (f ) N 0, k ^f k 2, k=1 where ^f k = 1 f (s(z)) dz 2πi z =1 z k+1. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
64 A general limit theorem Theorem Let J R be a right limit of J with subsequence {n j } j. Define { ( ) JM R (J R ) kl, k, l = M,..., M, =. kl 0, otherwise Let P be{ the projection on the negative coefficients x k k < 0 (P x) k =. Then for any polynomial f we have 0 k 0. lim E [ exp t(x nj (f ) EX nj (f )) ] j ) = lim M et Tr P f (JR M ) det (I + P (e tf (JR M ) I )P In particular, both limits exist. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
65 A general limit theorem If J R is a Laurent matrix, the right-hand side can be computed giving the previous CLT. It is an interesting open problem to find the limiting value at the right-hand side if J R is, for example, two-periodic. This should of course match with the formulas for the multi-cut case by Shcherbina 13, Borot-Guionnet 13 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
66 Biorthogonal ensembles M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
67 Biorthogonal ensembles Let µ be a Borel measure on R and {φ j },{ψ j } two families of linearly indendent functions. Then the corresponding biorthogonal ensemble of size n is defined as the probability measure on R n proportional to det (φ k 1 (x j )) n j,k=1 det (ψ k 1(x j )) n j,k=1 dµ(x 1) dµ(x n ) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
68 Biorthogonal ensembles Let µ be a Borel measure on R and {φ j },{ψ j } two families of linearly indendent functions. Then the corresponding biorthogonal ensemble of size n is defined as the probability measure on R n proportional to det (φ k 1 (x j )) n j,k=1 det (ψ k 1(x j )) n j,k=1 dµ(x 1) dµ(x n ) By taking linear combination of the rows we can assume that φ k (x)ψ l (x)dµ(x) = δ kl. R M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
69 Biorthogonal ensembles Let µ be a Borel measure on R and {φ j },{ψ j } two families of linearly indendent functions. Then the corresponding biorthogonal ensemble of size n is defined as the probability measure on R n proportional to det (φ k 1 (x j )) n j,k=1 det (ψ k 1(x j )) n j,k=1 dµ(x 1) dµ(x n ) By taking linear combination of the rows we can assume that φ k (x)ψ l (x)dµ(x) = δ kl. R The biorthogonal ensembles is a determinantal point process on R with kernel n 1 K n (x, y) = φ j (x)ψ j (y) and reference measure µ. k=0 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
70 Biorthogonal ensembles with a recurrence We will assume that there exists a banded one-sided infinite matrix J such that φ 0 (x) φ 0 (x) φ 1 (x) x φ 2 (x) = J φ 1 (x) φ 2 (x).. Since J is banded this is a recurrence. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
71 Biorthogonal ensembles with a recurrence We will assume that there exists a banded one-sided infinite matrix J such that φ 0 (x) φ 0 (x) φ 1 (x) x φ 2 (x) = J φ 1 (x) φ 2 (x).. Since J is banded this is a recurrence. We will allow that J varies with n, i.e. J = J (n), in which case we assume that the number of bands is independent of n. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
72 Biorthogonal ensembles with a recurrence We will assume that there exists a banded one-sided infinite matrix J such that φ 0 (x) φ 0 (x) φ 1 (x) x φ 2 (x) = J φ 1 (x) φ 2 (x).. Since J is banded this is a recurrence. We will allow that J varies with n, i.e. J = J (n), in which case we assume that the number of bands is independent of n. There many interesting biorthogonal ensembles that admit such a recurrence. In particular when we are concerned Multiple Orthogonal Polynomials Ensembles. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
73 Example: unitary ensembles with external source Consider the eigenvalues of a n n Hermitian matrix randomly chosen from 1 Z n e c Tr(M2 AM) dm where c > 0 and A is a diagonal matrix with eigenvalues a 1,..., a m of multiplicities k 1,..., k m. Brezin-Hikami 97. Alternatively, consider n non-intersecting brownian paths, with k j paths conditioned to start at 0 a time t = 0 and end at b j at time t = 1. Location of paths at time t has the same distribution as the eigenvalues of M with a j = 2tb j and c = 1/t(1 t). M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
74 The eigenvalues form a biorthogonal ensemble constructed out of multiple Hermite polynomials with m weights. These polynomials satisfy an m + 2-term recurrence. Bleher-Kuijlaars 04 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
75 Example: two matrix model Consider the eigenvalues of two n n Hermitian matrices (M 1, M 2 ) randomly chosen from 1 Z n e Tr(V (M 1)+W (M 2 ) τm 1 M 2 ) dm 1 dm 2 where V and W are polynomials such that the integral converges. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
76 Example: two matrix model Consider the eigenvalues of two n n Hermitian matrices (M 1, M 2 ) randomly chosen from 1 Z n e Tr(V (M 1)+W (M 2 ) τm 1 M 2 ) dm 1 dm 2 where V and W are polynomials such that the integral converges. In Eynard-Mehta 98 it was shown that the eigenvalue correlations have determinantal struture with kernels constructed out of the biorthogonal polynomials p j and q k of degree j and k such that p j (x)q k (y)e V (x) W (y)+τxy dxdy = δ jk. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
77 Example: two matrix model The eigenvalues of M 1, when averaged over M 2, form a biorthogonal ensembles with φ j (x) = p j 1 (x) ψ j (x) = q j 1 (y)e (V (x)+w (y) τxy)) dy. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
78 Example: two matrix model The eigenvalues of M 1, when averaged over M 2, form a biorthogonal ensembles with φ j (x) = p j 1 (x) ψ j (x) = q j 1 (y)e (V (x)+w (y) τxy)) dy. The polynomials p j satisfy a d W + 1-term recurrence, where d W is the degree of W. Bertola-Eynard-Harnad 02 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
79 Example: two matrix model The eigenvalues of M 1, when averaged over M 2, form a biorthogonal ensembles with φ j (x) = p j 1 (x) ψ j (x) = q j 1 (y)e (V (x)+w (y) τxy)) dy. The polynomials p j satisfy a d W + 1-term recurrence, where d W is the degree of W. Bertola-Eynard-Harnad 02 In D-Kuijlaars 08, D-Kuijlaars-Mo 12, D-Geudens-Kuijlaars 11, D-Geudens 13 the asymptotics have been computed for W (y) = y 4 /4 + αy 2 /2 and V even, using Riemann-Hilbert methods, from which we can compute the recurrence coefficients. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
80 CLT for biorthogonal ensembles Theorem (Breuer-D 13) Assume that L(s) is a right limit of J (n) with subsequence {n j } j for some s(z) = p j= q s jz j. Then, if f is a polynomial with real coefficients, X nj (f ) EX nj (f ) N ( 0, ) k ^f k 2, k=1 as j, where ^f k = 1 f (s(z)) dz 2πi z =1 z k+1. Note: for orthogonal polynomial ensembles p = q = 1. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
81 CLT for biorthogonal ensembles Theorem (Breuer-D 13) Assume that L(s) is a right limit of J (n) with subsequence {n j } j for some s(z) = p j= q s jz j. Then, if f is a polynomial with real coefficients, X nj (f ) EX nj (f ) N ( 0, ) k ^f k 2, k=1 as j, where ^f k = 1 f (s(z)) dz 2πi z =1 z k+1. Note: for orthogonal polynomial ensembles p = q = 1. In case K n K n then we have no concentration inequality and hence extension to f C 1 (R), without more a priori knowledge. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
82 A general limit theorem Theorem Let J R be a right limit of J with subsequence {n j } j. Define { ( ) JM R (J R ) kl, k, l = M,..., M, =. kl 0, otherwise Let P be{ the projection on the negative coefficients x k k < 0 (P x) k =. Then for any polynomial f we have 0 k 0. lim E [exp t(x n(f ) EX n (f ))] j In particular, both limits exist. = lim M et Tr P f (JR M ) det (I + P (e tf (JR M ) I )P ) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
83 Some words about the proofs M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
84 Cumulant expansion Expand the moment-generating function E [exp tx n (f )]) = det(1 + (e tf 1)K n ) ) = exp Tr log (1 + (e tf 1)K n ( ) = exp t m C m (n) (f ) m=1 where C (n) m (f ) = m ( 1) j j=1 The are called the cumulants. j l 1 + +l j =m,l i 1 Tr f l 1 K n f l j K n l 1! l j! M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
85 For a Central Limit Theorem one needs to show that { lim C m (n) 2σ(f ) 2, m = 2 (f ) n 0, m 3. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
86 For a Central Limit Theorem one needs to show that { lim C m (n) 2σ(f ) 2, m = 2 (f ) n 0, m 3. A first problem: each term in the sum C (n) m (f ) = m ( 1) j j=1 j l 1 + +l j =m,l i 1 Tr f l 1 K n f l j K n l 1! l j! grows linearly with n. Clearly, some very effective cancelation must come into play! M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
87 By using the identity x = log (1 + (e x 1)) and expanding the right-hand side we obtain if m 2. m ( 1) j j=1 j l 1 + +l j =m,l i 1 1 l 1! l j! = 0 M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
88 By using the identity x = log (1 + (e x 1)) and expanding the right-hand side we obtain if m 2. m ( 1) j j=1 j l 1 + +l j =m,l i 1 1 l 1! l j! = 0 Hence C (n) m (f ) = m ( 1) j j=1 j l 1 + +l j =m,l i 1 Tr f l 1 K n f l j K n Tr f m K n l 1! l j! for m 2. Now each term in the double sum can be proved to be bounded and this captures a first cancelation. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
89 Concentration inequality Using Kn 2 = K n and Kn = K n one can show that Tr f l 1 K n f l j K n Tr f m K n jm 2 f m 2 [f, K n ] 2 2, m 2 where [f, K n ] 2 is the Hilbert-Schmidt norm for the commutator of K n anf f (viewed as a multiplication operator). M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
90 Concentration inequality Using Kn 2 = K n and Kn = K n one can show that Tr f l 1 K n f l j K n Tr f m K n jm 2 f m 2 [f, K n ] 2 2, m 2 where [f, K n ] 2 is the Hilbert-Schmidt norm for the commutator of K n anf f (viewed as a multiplication operator). If K n = K n then [f, K n ] 2 2 = 2VarX n (f ) and the mentioned concentration inequality Breuer-D 13 follows after a further arranging of terms. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
91 Concentration inequality Using Kn 2 = K n and Kn = K n one can show that Tr f l 1 K n f l j K n Tr f m K n jm 2 f m 2 [f, K n ] 2 2, m 2 where [f, K n ] 2 is the Hilbert-Schmidt norm for the commutator of K n anf f (viewed as a multiplication operator). If K n = K n then [f, K n ] 2 2 = 2VarX n (f ) and the mentioned concentration inequality Breuer-D 13 follows after a further arranging of terms. For a CLT we need to capture another cancelation. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
92 Use orthogonality to rewrite C (n) m (f ) = = m ( 1) j j=1 j m ( 1) j j=1 j l 1 + +l j =m,l i 1 l 1 + +l j =m,l i 1 Tr f l 1 K n f l j K n Tr f m K n l 1! l j! Tr f (J) l 1 P n f (J) l j P n Tr f (J) m P n l 1! l j! M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
93 Use orthogonality to rewrite C (n) m (f ) = = m ( 1) j j=1 j m ( 1) j j=1 j l 1 + +l j =m,l i 1 l 1 + +l j =m,l i 1 Tr f l 1 K n f l j K n Tr f m K n l 1! l j! Tr f (J) l 1 P n f (J) l j P n Tr f (J) m P n l 1! l j! By using the band structure of J (and hence of f (J) for polynomial f ) it is not hard to prove that Tr f (J) l 1 P n f (J) l j P n Tr f (J) m P n only depends on a finite and fixed number of recurrence coefficients. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
94 Use orthogonality to rewrite C (n) m (f ) = = m ( 1) j j=1 j m ( 1) j j=1 j l 1 + +l j =m,l i 1 l 1 + +l j =m,l i 1 Tr f l 1 K n f l j K n Tr f m K n l 1! l j! Tr f (J) l 1 P n f (J) l j P n Tr f (J) m P n l 1! l j! By using the band structure of J (and hence of f (J) for polynomial f ) it is not hard to prove that Tr f (J) l 1 P n f (J) l j P n Tr f (J) m P n only depends on a finite and fixed number of recurrence coefficients. This does not prove the desired asymptotic behavior, but it does show that only a relatively small part of J matters in the fluctuation. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
95 Comparison/Universality principle If J 1 and J 2 have the same right limit J R along the same subsequence {n j }, then the leading term in the asympotic behavior of the fluctuations for the linear statistics for polynomial f along that subsequence is the same. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
96 Comparison/Universality principle If J 1 and J 2 have the same right limit J R along the same subsequence {n j }, then the leading term in the asympotic behavior of the fluctuations for the linear statistics for polynomial f along that subsequence is the same. Hence if J has a Laurent matrix L(s) as a right limit, then we can assume that J = T (s) from the start! Here T (s) is the Toeplitz operator with symbol s. Hence we only need to compute the CLT for the special Toeplitz case and the rest follows by the comparison principle. M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
97 Lemma (Breuer-D 13) Let s(z) = p j= q s jz j be a Laurent polynomial. Then ( ( ) lim det I + P n (e T (s) I )P n e Tr PnT (s) 1 = exp n 2 ) ks k s k k=1 Proof is based on Ehrhardt s generalization of the Helton-Howe-Pincus formula: if [A, B] is trace class, then det e A e A+B e B = exp 1 Tr[A, B]. 2 (This beautiful formula essentially captures the final cancelations in the cumulant expansion) M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
98 Thank you for your attention! M. Duits (SU) CLT s for linear statistics Princeton, April 2, / 53
Markov operators, classical orthogonal polynomial ensembles, and random matrices
Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random
More informationUniversality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium
Universality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium SEA 06@MIT, Workshop on Stochastic Eigen-Analysis and its Applications, MIT, Cambridge,
More informationFluctuations of random tilings and discrete Beta-ensembles
Fluctuations of random tilings and discrete Beta-ensembles Alice Guionnet CRS (E S Lyon) Advances in Mathematics and Theoretical Physics, Roma, 2017 Joint work with A. Borodin, G. Borot, V. Gorin, J.Huang
More informationTwo-periodic Aztec diamond
Two-periodic Aztec diamond Arno Kuijlaars (KU Leuven) joint work with Maurice Duits (KTH Stockholm) Optimal and Random Point Configurations ICERM, Providence, RI, U.S.A., 27 February 2018 Outline 1. Aztec
More informationFluctuations of random tilings and discrete Beta-ensembles
Fluctuations of random tilings and discrete Beta-ensembles Alice Guionnet CRS (E S Lyon) Workshop in geometric functional analysis, MSRI, nov. 13 2017 Joint work with A. Borodin, G. Borot, V. Gorin, J.Huang
More informationFree probabilities and the large N limit, IV. Loop equations and all-order asymptotic expansions... Gaëtan Borot
Free probabilities and the large N limit, IV March 27th 2014 Loop equations and all-order asymptotic expansions... Gaëtan Borot MPIM Bonn & MIT based on joint works with Alice Guionnet, MIT Karol Kozlowski,
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationCentral Limit Theorem for discrete log gases
Central Limit Theorem for discrete log gases Vadim Gorin MIT (Cambridge) and IITP (Moscow) (based on joint work with Alexei Borodin and Alice Guionnet) April, 205 Setup and overview λ λ 2 λ N, l i = λ
More informationThe Hermitian two matrix model with an even quartic potential. Maurice Duits Arno B.J. Kuijlaars Man Yue Mo
The Hermitian two matrix model with an even quartic potential Maurice Duits Arno B.J. Kuijlaars Man Yue Mo First published in Memoirs of the American Mathematical Society in vol. 217, no. 1022, 2012, published
More informationDeterminantal point processes and random matrix theory in a nutshell
Determinantal point processes and random matrix theory in a nutshell part I Manuela Girotti based on M. Girotti s PhD thesis and A. Kuijlaars notes from Les Houches Winter School 202 Contents Point Processes
More informationORTHOGONAL POLYNOMIALS
ORTHOGONAL POLYNOMIALS 1. PRELUDE: THE VAN DER MONDE DETERMINANT The link between random matrix theory and the classical theory of orthogonal polynomials is van der Monde s determinant: 1 1 1 (1) n :=
More informationFluctuations from the Semicircle Law Lecture 4
Fluctuations from the Semicircle Law Lecture 4 Ioana Dumitriu University of Washington Women and Math, IAS 2014 May 23, 2014 Ioana Dumitriu (UW) Fluctuations from the Semicircle Law Lecture 4 May 23, 2014
More informationTriangular matrices and biorthogonal ensembles
/26 Triangular matrices and biorthogonal ensembles Dimitris Cheliotis Department of Mathematics University of Athens UK Easter Probability Meeting April 8, 206 2/26 Special densities on R n Example. n
More informationRANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS
RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS David García-García May 13, 2016 Faculdade de Ciências da Universidade de Lisboa OVERVIEW Random Matrix Theory Introduction Matrix ensembles A sample computation:
More informationUniformly Random Lozenge Tilings of Polygons on the Triangular Lattice
Interacting Particle Systems, Growth Models and Random Matrices Workshop Uniformly Random Lozenge Tilings of Polygons on the Triangular Lattice Leonid Petrov Department of Mathematics, Northeastern University,
More informationConcentration Inequalities for Random Matrices
Concentration Inequalities for Random Matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify the asymptotic
More informationDouble contour integral formulas for the sum of GUE and one matrix model
Double contour integral formulas for the sum of GUE and one matrix model Based on arxiv:1608.05870 with Tom Claeys, Arno Kuijlaars, and Karl Liechty Dong Wang National University of Singapore Workshop
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationExtreme eigenvalue fluctutations for GUE
Extreme eigenvalue fluctutations for GUE C. Donati-Martin 204 Program Women and Mathematics, IAS Introduction andom matrices were introduced in multivariate statistics, in the thirties by Wishart [Wis]
More informationarxiv: v2 [math-ph] 20 Dec 2015
On global fluctuations for non-colliding processes arxiv:1510.0848v [math-ph] 0 Dec 015 Maurice Duits December, 015 Abstract We study the global fluctuations for a class of determinantal point processes
More informationAiry and Pearcey Processes
Airy and Pearcey Processes Craig A. Tracy UC Davis Probability, Geometry and Integrable Systems MSRI December 2005 1 Probability Space: (Ω, Pr, F): Random Matrix Models Gaussian Orthogonal Ensemble (GOE,
More informationDeterminantal point processes and random matrix theory in a nutshell
Determinantal point processes and random matrix theory in a nutshell part II Manuela Girotti based on M. Girotti s PhD thesis, A. Kuijlaars notes from Les Houches Winter School 202 and B. Eynard s notes
More informationMicroscopic behavior for β-ensembles: an energy approach
Microscopic behavior for β-ensembles: an energy approach Thomas Leblé (joint with/under the supervision of) Sylvia Serfaty Université Paris 6 BIRS workshop, 14 April 2016 Thomas Leblé (Université Paris
More informationRandom Matrix: From Wigner to Quantum Chaos
Random Matrix: From Wigner to Quantum Chaos Horng-Tzer Yau Harvard University Joint work with P. Bourgade, L. Erdős, B. Schlein and J. Yin 1 Perhaps I am now too courageous when I try to guess the distribution
More informationMultiple orthogonal polynomials. Bessel weights
for modified Bessel weights KU Leuven, Belgium Madison WI, December 7, 2013 Classical orthogonal polynomials The (very) classical orthogonal polynomials are those of Jacobi, Laguerre and Hermite. Classical
More informationNUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS. Sheehan Olver NA Group, Oxford
NUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS Sheehan Olver NA Group, Oxford We are interested in numerically computing eigenvalue statistics of the GUE ensembles, i.e.,
More informationReal Variables # 10 : Hilbert Spaces II
randon ehring Real Variables # 0 : Hilbert Spaces II Exercise 20 For any sequence {f n } in H with f n = for all n, there exists f H and a subsequence {f nk } such that for all g H, one has lim (f n k,
More informationThe circular law. Lewis Memorial Lecture / DIMACS minicourse March 19, Terence Tao (UCLA)
The circular law Lewis Memorial Lecture / DIMACS minicourse March 19, 2008 Terence Tao (UCLA) 1 Eigenvalue distributions Let M = (a ij ) 1 i n;1 j n be a square matrix. Then one has n (generalised) eigenvalues
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationDifferential Equations for Dyson Processes
Differential Equations for Dyson Processes Joint work with Harold Widom I. Overview We call Dyson process any invariant process on ensembles of matrices in which the entries undergo diffusion. Dyson Brownian
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationDLR equations for the Sineβ process and applications
DLR equations for the Sineβ process and applications Thomas Leble (Courant Institute - NYU) Columbia University - 09/28/2018 Joint work with D. Dereudre, A. Hardy, M. Maı da (Universite Lille 1) Log-gases
More informationRadboud University Nijmegen
adboud University Nijmegen Faculty of Science The Matrix Moment Problem Author: Student number: Study: Supervisor: Second eader: Luud Slagter 4021002 Master Mathematics Prof. dr. H.T. Koelink Dr. P.M.
More informationLarge Deviations for Random Matrices and a Conjecture of Lukic
Large Deviations for Random Matrices and a Conjecture of Lukic Jonathan Breuer Hebrew University of Jerusalem Joint work with B. Simon (Caltech) and O. Zeitouni (The Weizmann Institute) Western States
More informationA Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices
A Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices Michel Ledoux Institut de Mathématiques, Université Paul Sabatier, 31062 Toulouse, France E-mail: ledoux@math.ups-tlse.fr
More informationDeterminants of Perturbations of Finite Toeplitz Matrices. Estelle Basor American Institute of Mathematics
Determinants of Perturbations of Finite Toeplitz Matrices Estelle Basor American Institute of Mathematics October 2010 One of the purposes of this talk is to describe a Helton observation that fundamentally
More informationGaussian Free Field in (self-adjoint) random matrices and random surfaces. Alexei Borodin
Gaussian Free Field in (self-adjoint) random matrices and random surfaces Alexei Borodin Corners of random matrices and GFF spectra height function liquid region Theorem As Unscaled fluctuations Gaussian
More informationGaussian Free Field in beta ensembles and random surfaces. Alexei Borodin
Gaussian Free Field in beta ensembles and random surfaces Alexei Borodin Corners of random matrices and GFF spectra height function liquid region Theorem As Unscaled fluctuations Gaussian (massless) Free
More informationValerio Cappellini. References
CETER FOR THEORETICAL PHYSICS OF THE POLISH ACADEMY OF SCIECES WARSAW, POLAD RADOM DESITY MATRICES AD THEIR DETERMIATS 4 30 SEPTEMBER 5 TH SFB TR 1 MEETIG OF 006 I PRZEGORZAłY KRAKÓW Valerio Cappellini
More informationLocal semicircle law, Wegner estimate and level repulsion for Wigner random matrices
Local semicircle law, Wegner estimate and level repulsion for Wigner random matrices László Erdős University of Munich Oberwolfach, 2008 Dec Joint work with H.T. Yau (Harvard), B. Schlein (Cambrigde) Goal:
More informationRandom regular digraphs: singularity and spectrum
Random regular digraphs: singularity and spectrum Nick Cook, UCLA Probability Seminar, Stanford University November 2, 2015 Universality Circular law Singularity probability Talk outline 1 Universality
More informationStein s Method and Characteristic Functions
Stein s Method and Characteristic Functions Alexander Tikhomirov Komi Science Center of Ural Division of RAS, Syktyvkar, Russia; Singapore, NUS, 18-29 May 2015 Workshop New Directions in Stein s method
More informationAngular matrix integrals
Montreal, 25 August 2008 1 Angular matrix integrals Montreal, 25 August 2008 J.-B. uber A. Prats Ferrer, B. Eynard, P. Di Francesco, J.-B... Correlation Functions of Harish-Chandra Integrals over the Orthogonal
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationEigenvalue variance bounds for Wigner and covariance random matrices
Eigenvalue variance bounds for Wigner and covariance random matrices S. Dallaporta University of Toulouse, France Abstract. This work is concerned with finite range bounds on the variance of individual
More informationLecture I: Asymptotics for large GUE random matrices
Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random
More informationRandom Matrices and Determinantal Process
Random Matrices and Determinantal Process February 27 - March 3, 2017 Gernot Akemann: Universality in products of two coupled random matrices: Finite rank perturbations The singular values of products
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationFredholm determinant with the confluent hypergeometric kernel
Fredholm determinant with the confluent hypergeometric kernel J. Vasylevska joint work with I. Krasovsky Brunel University Dec 19, 2008 Problem Statement Let K s be the integral operator acting on L 2
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationSpectral analysis of two doubly infinite Jacobi operators
Spectral analysis of two doubly infinite Jacobi operators František Štampach jointly with Mourad E. H. Ismail Stockholm University Spectral Theory and Applications conference in memory of Boris Pavlov
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
More informationLectures 6 7 : Marchenko-Pastur Law
Fall 2009 MATH 833 Random Matrices B. Valkó Lectures 6 7 : Marchenko-Pastur Law Notes prepared by: A. Ganguly We will now turn our attention to rectangular matrices. Let X = (X 1, X 2,..., X n ) R p n
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationarxiv: v1 [math-ph] 19 Oct 2018
COMMENT ON FINITE SIZE EFFECTS IN THE AVERAGED EIGENVALUE DENSITY OF WIGNER RANDOM-SIGN REAL SYMMETRIC MATRICES BY G.S. DHESI AND M. AUSLOOS PETER J. FORRESTER AND ALLAN K. TRINH arxiv:1810.08703v1 [math-ph]
More informationAsymptotics of Hermite polynomials
Asymptotics of Hermite polynomials Michael Lindsey We motivate the study of the asymptotics of Hermite polynomials via their appearance in the analysis of the Gaussian Unitary Ensemble (GUE). Following
More informationZeros and ratio asymptotics for matrix orthogonal polynomials
Zeros and ratio asymptotics for matrix orthogonal polynomials Steven Delvaux, Holger Dette August 25, 2011 Abstract Ratio asymptotics for matrix orthogonal polynomials with recurrence coefficients A n
More informationCHAPTER 8. Smoothing operators
CHAPTER 8 Smoothing operators Lecture 8: 13 October, 2005 Now I am heading towards the Atiyah-Singer index theorem. Most of the results proved in the process untimately reduce to properties of smoothing
More informationNonlinear Integral Equation Formulation of Orthogonal Polynomials
Nonlinear Integral Equation Formulation of Orthogonal Polynomials Eli Ben-Naim Theory Division, Los Alamos National Laboratory with: Carl Bender (Washington University, St. Louis) C.M. Bender and E. Ben-Naim,
More informationNon white sample covariance matrices.
Non white sample covariance matrices. S. Péché, Université Grenoble 1, joint work with O. Ledoit, Uni. Zurich 17-21/05/2010, Université Marne la Vallée Workshop Probability and Geometry in High Dimensions
More informationGaussian Random Fields
Gaussian Random Fields Mini-Course by Prof. Voijkan Jaksic Vincent Larochelle, Alexandre Tomberg May 9, 009 Review Defnition.. Let, F, P ) be a probability space. Random variables {X,..., X n } are called
More informationMultiple Orthogonal Polynomials
Summer school on OPSF, University of Kent 26 30 June, 2017 Introduction For this course I assume everybody is familiar with the basic theory of orthogonal polynomials: Introduction For this course I assume
More informationOPSF, Random Matrices and Riemann-Hilbert problems
OPSF, Random Matrices and Riemann-Hilbert problems School on Orthogonal Polynomials in Approximation Theory and Mathematical Physics, ICMAT 23 27 October, 2017 Plan of the course lecture 1: Orthogonal
More informationTOEPLITZ OPERATORS. Toeplitz studied infinite matrices with NW-SE diagonals constant. f e C :
TOEPLITZ OPERATORS EFTON PARK 1. Introduction to Toeplitz Operators Otto Toeplitz lived from 1881-1940 in Goettingen, and it was pretty rough there, so he eventually went to Palestine and eventually contracted
More informationRectangular Young tableaux and the Jacobi ensemble
Rectangular Young tableaux and the Jacobi ensemble Philippe Marchal October 20, 2015 Abstract It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau
More informationOrthogonal Polynomial Ensembles
Chater 11 Orthogonal Polynomial Ensembles 11.1 Orthogonal Polynomials of Scalar rgument Let wx) be a weight function on a real interval, or the unit circle, or generally on some curve in the comlex lane.
More informationFrom the mesoscopic to microscopic scale in random matrix theory
From the mesoscopic to microscopic scale in random matrix theory (fixed energy universality for random spectra) With L. Erdős, H.-T. Yau, J. Yin Introduction A spacially confined quantum mechanical system
More informationFrom random matrices to free groups, through non-crossing partitions. Michael Anshelevich
From random matrices to free groups, through non-crossing partitions Michael Anshelevich March 4, 22 RANDOM MATRICES For each N, A (N), B (N) = independent N N symmetric Gaussian random matrices, i.e.
More informationSpectral Theory of Orthogonal Polynomials
Spectral Theory of Orthogonal Barry Simon IBM Professor of Mathematics and Theoretical Physics California Institute of Technology Pasadena, CA, U.S.A. Lecture 2: Szegö Theorem for OPUC for S Spectral Theory
More informationDEVIATION INEQUALITIES ON LARGEST EIGENVALUES
DEVIATION INEQUALITIES ON LARGEST EIGENVALUES M. Ledoux University of Toulouse, France In these notes, we survey developments on the asymptotic behavior of the largest eigenvalues of random matrix and
More informationUpdate on the beta ensembles
Update on the beta ensembles Brian Rider Temple University with M. Krishnapur IISC, J. Ramírez Universidad Costa Rica, B. Virág University of Toronto The Tracy-Widom laws Consider a random Hermitian n
More informationSimultaneous Gaussian quadrature for Angelesco systems
for Angelesco systems 1 KU Leuven, Belgium SANUM March 22, 2016 1 Joint work with Doron Lubinsky Introduced by C.F. Borges in 1994 Introduced by C.F. Borges in 1994 (goes back to Angelesco 1918). Introduced
More informationarxiv: v3 [math-ph] 23 May 2017
arxiv:161.8561v3 [math-ph] 3 May 17 On the probability of positive-definiteness in the ggue via semi-classical Laguerre polynomials Alfredo Deaño and icholas J. Simm May 5, 17 Abstract In this paper, we
More informationA Note on the Central Limit Theorem for the Eigenvalue Counting Function of Wigner and Covariance Matrices
A Note on the Central Limit Theorem for the Eigenvalue Counting Function of Wigner and Covariance Matrices S. Dallaporta University of Toulouse, France Abstract. This note presents some central limit theorems
More informationCompact symetric bilinear forms
Compact symetric bilinear forms Mihai Mathematics Department UC Santa Barbara IWOTA 2006 IWOTA 2006 Compact forms [1] joint work with: J. Danciger (Stanford) S. Garcia (Pomona
More informationComparison Method in Random Matrix Theory
Comparison Method in Random Matrix Theory Jun Yin UW-Madison Valparaíso, Chile, July - 2015 Joint work with A. Knowles. 1 Some random matrices Wigner Matrix: H is N N square matrix, H : H ij = H ji, EH
More informationVector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.
Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +
More informationClark model in the general situation
Constanze Liaw (Baylor University) at UNAM April 2014 This talk is based on joint work with S. Treil. Classical perturbation theory Idea of perturbation theory Question: Given operator A, what can be said
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More information1 Tridiagonal matrices
Lecture Notes: β-ensembles Bálint Virág Notes with Diane Holcomb 1 Tridiagonal matrices Definition 1. Suppose you have a symmetric matrix A, we can define its spectral measure (at the first coordinate
More informationPainlevé Representations for Distribution Functions for Next-Largest, Next-Next-Largest, etc., Eigenvalues of GOE, GUE and GSE
Painlevé Representations for Distribution Functions for Next-Largest, Next-Next-Largest, etc., Eigenvalues of GOE, GUE and GSE Craig A. Tracy UC Davis RHPIA 2005 SISSA, Trieste 1 Figure 1: Paul Painlevé,
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationReview of some mathematical tools
MATHEMATICAL FOUNDATIONS OF SIGNAL PROCESSING Fall 2016 Benjamín Béjar Haro, Mihailo Kolundžija, Reza Parhizkar, Adam Scholefield Teaching assistants: Golnoosh Elhami, Hanjie Pan Review of some mathematical
More informationOptimal series representations of continuous Gaussian random fields
Optimal series representations of continuous Gaussian random fields Antoine AYACHE Université Lille 1 - Laboratoire Paul Painlevé A. Ayache (Lille 1) Optimality of continuous Gaussian series 04/25/2012
More informationThe Matrix Dyson Equation in random matrix theory
The Matrix Dyson Equation in random matrix theory László Erdős IST, Austria Mathematical Physics seminar University of Bristol, Feb 3, 207 Joint work with O. Ajanki, T. Krüger Partially supported by ERC
More informationBeyond the Gaussian universality class
Beyond the Gaussian universality class MSRI/Evans Talk Ivan Corwin (Courant Institute, NYU) September 13, 2010 Outline Part 1: Random growth models Random deposition, ballistic deposition, corner growth
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationINVARIANT SUBSPACES FOR CERTAIN FINITE-RANK PERTURBATIONS OF DIAGONAL OPERATORS. Quanlei Fang and Jingbo Xia
INVARIANT SUBSPACES FOR CERTAIN FINITE-RANK PERTURBATIONS OF DIAGONAL OPERATORS Quanlei Fang and Jingbo Xia Abstract. Suppose that {e k } is an orthonormal basis for a separable, infinite-dimensional Hilbert
More informationarxiv: v1 [math.pr] 22 May 2008
THE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n 1/2 ) arxiv:0805.3407v1 [math.pr] 22 May 2008 MARK RUDELSON AND ROMAN VERSHYNIN Abstract. Let A be a matrix whose entries are real i.i.d. centered
More informationInner product spaces. Layers of structure:
Inner product spaces Layers of structure: vector space normed linear space inner product space The abstract definition of an inner product, which we will see very shortly, is simple (and by itself is pretty
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationHilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.
Hilbert Spaces Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Vector Space. Vector space, ν, over the field of complex numbers,
More informationUpper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1
Upper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1 Feng Wei 2 University of Michigan July 29, 2016 1 This presentation is based a project under the supervision of M. Rudelson.
More informationON THE SECOND-ORDER CORRELATION FUNCTION OF THE CHARACTERISTIC POLYNOMIAL OF A HERMITIAN WIGNER MATRIX
ON THE SECOND-ORDER CORRELATION FUNCTION OF THE CHARACTERISTIC POLYNOMIAL OF A HERMITIAN WIGNER MATRIX F. GÖTZE AND H. KÖSTERS Abstract. We consider the asymptotics of the second-order correlation function
More informationProblems Session. Nikos Stylianopoulos University of Cyprus
[ 1 ] University of Cyprus Problems Session Nikos Stylianopoulos University of Cyprus Hausdorff Geometry Of Polynomials And Polynomial Sequences Institut Mittag-Leffler Djursholm, Sweden May-June 2018
More informationApplications and fundamental results on random Vandermon
Applications and fundamental results on random Vandermonde matrices May 2008 Some important concepts from classical probability Random variables are functions (i.e. they commute w.r.t. multiplication)
More informationTrace Class Operators and Lidskii s Theorem
Trace Class Operators and Lidskii s Theorem Tom Phelan Semester 2 2009 1 Introduction The purpose of this paper is to provide the reader with a self-contained derivation of the celebrated Lidskii Trace
More informationConvergence of spectral measures and eigenvalue rigidity
Convergence of spectral measures and eigenvalue rigidity Elizabeth Meckes Case Western Reserve University ICERM, March 1, 2018 Macroscopic scale: the empirical spectral measure Macroscopic scale: the empirical
More informationStatistical Mechanics and Combinatorics : Lecture IV
Statistical Mechanics and Combinatorics : Lecture IV Dimer Model Local Statistics We ve already discussed the partition function Z for dimer coverings in a graph G which can be computed by Kasteleyn matrix
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More information