Brown University Analysis Seminar
|
|
- Imogen Wiggins
- 5 years ago
- Views:
Transcription
1 Brown University Analysis Seminar Eigenvalue Statistics for Ensembles of Random Matrices (especially Toeplitz and Palindromic Toeplitz) Steven J. Miller Brown University Providence, RI, September 15 th, sjmiller/math/talks/talks.html
2 Collaborators Random Matrices Peter Sarnak Rebecca Lehman Yi-Kai Liu Chris Hammond John Ramey John Sinsheimer Jason Teich Inna Zakharevich Random Graphs Peter Sarnak Yakov Sinai Lior Silberman Dustin Steinhauer Randy Qian Felice Kuan Leo Goldmakher 1
3 Fundamental Problem General Formulation: Studying some system, observe events at t 1 t 2 t 3 Question: what rules govern the distribution of events? Often normalize by average spacing. 2
4 Examples Spacings Between Energy Levels of Heavy Nuclei. Spacings Between Eigenvalues of Large Matrices. Spacings Between High Zeros of L-Functions. 3
5 Origins of Random Matrix Theory Classical Mechanics: 3 Body Problem Intractable. Heavy nuclei like Uranium (200+ protons / neutrons) even worse! Fundamental Equation: Hψ n = E n ψ n E n are the energy levels Approximate with finite matrix. 4
6 Statistical Mechanics For each configuration, calculate quantity (say pressure). Average over all configurations. 5
7 Random Matrix Ensembles A = a 11 a 12 a 13 a 1N a 12. a 22. a 23 a 2N..... a 1N a 2N a 3N a NN = AT Let p(x) be a probability density, often assume moments finite. k th -moment = x k p(x)dx. Define R Prob(A)dA = 1 i<j N p(a ij )da ij. 6
8 Eigenvalue Questions Density of Eigenvalues: How many eigenvalues lie in an interval [a, b]? Spacings between Eigenvalues: How are the spacings between adjacent eigenvalues distributed? Note: study normalized eigenvalues. 7
9 Eigenvalue Distribution Key to Averaging: N Trace(A k ) = λ k i (A). i=1 By the Central Limit Theorem: N N Trace(A 2 ) = a ij a ji = i=1 N j=1 N i=1 j=1 N 2 1 N λ 2 i (A) N 2 i=1 a 2 ij Gives NAve(λ 2 i (A)) N 2 or λ i (A) N. 8
10 Eigenvalue Distribution (cont) δ(x x 0 ) is a unit point mass at x 0. To each A, attach a probability measure: Obtain: µ A,N (x) = 1 N N δ i=1 ( x λ ) i(a) 2 N k th -moment = x k µ A,N (x)dx = 1 N N i=1 = Trace(Ak ) 2 k N k 2 +1 λ k i (A) (2 N) k 9
11 Semi-Circle Law N N real symmetric matrices, entries i.i.d.r.v. from a fixed p(x). Semi-Circle Law: p mean 0, variance 1, other moments finite. With probability 1, µ A,N (x) 2 π 1 x 2 weakly Expected value of k th -moment of µ A,N (x) is R R Trace(A k ) 2 k N k 2 +1 i<j p(a ij )da ij 10
12 With probability 1, Method of Proof µ A,N (x) µ Semi-Circle (x) weakly. Will do this by showing E[M k (µ A,N )] M k (SC) and E[ M k (µ A,N ) E[M k (µ A,N )] 2 ] 0. 11
13 Proof: 2 nd -Moment Trace(A 2 ) = N i=1 N j=1 a ij a ji = N i=1 N j=1 a 2 ij. Substituting: N 2 R N R i,j=1 Integration factors as a 2 ji p(a 11 )da 11 p(a NN )da NN a ij R a 2 ijp(a ij )da ij (k,l) (ij) k<l a kl R p(a kl )da kl = 1. Have N 2 summands, answer is 1 4. Key: Trace and Averaging Formulas. 12
14 Random Matrix Theory: Semi-Circle Law Distribution of eigenvalues Gaussian, N=400, 500 matrices Matrices: Gaussian p(x) = 1 e x2 /2 2π 13
15 Random Matrix Theory: Semi-Circle Law 2500 The eigenvalues of the Cauchy distribution are NOT semicirular Cauchy Distr: Not-Semicircular (Infinite Variance) p(x) = 1 π(1+x 2 ) 14
16 GOE Conjecture GOE Conjecture: N N Real Symmetric, entries iidrv. As N, the probability density of the distance between two consecutive, normalized eigenvalues universal. Only known if entries chosen from Gaussian. Consecutive spacings well approximated by Axe Bx2. 15
17 Uniform Distribution: p(x) = x 104 The local spacings of the central 3/5 of the eigenvalues of x300 uniform matrices, normalized in batches of : uniform on [ 1, 1] 16
18 Cauchy Distribution: p(x) = 1 π(1+x 2 ) The local spacings of the central 3/5 of the eigenvalues of x100 Cauchy matrices, normalized in batches of : Cauchy 3.5 x 104 The local spacings of the central 3/5 of the eigenvalues of x300 Cauchy matrices, normalized in batches of : Cauchy 17
19 Fat Thin Families Need a family F A T enough to do averaging. Need a family THIN enough so that everything isn t averaged out. Real Symmetric Matrices have N(N+1) 2 independent entries. Examples of thin sub-families: Band Matrices Random Graphs Special Matrices (Toeplitz) 18
20 Band Matrices Example of a Band 1 Matrix: a 11 a a 12 a 22 a a 23 a 33 a a N 1,N a N 1,N a NN For Band 0 (Diagonal Matrices): Density of Eigenvalues: p(x) Spacings b/w eigenvalues: Poissonian. 19
21 Random Graphs Degree of a vertex = number of edges leaving the vertex. Adjacency matrix: a ij vertex i to vertex j. = number edges from A = These are Real Symmetric Matrices. 20
22 McKay s Law (Kesten Measure) Density of States for d-regular graphs f(x) = { d 2π(d 2 x 2 ) 4(d 1) x 2 x 2 d 1 0 otherwise d = 3. 21
23 McKay s Law (Kesten Measure) d = 6. Idea of proof: Trace lemma, combinatorics and counting, locally a tree. Fat Thin: fat enough to average, thin enough to get something different than Semi-circle. 22
24 d-regular and GOE Regular, 2000 Vertices: Graph courtesy of D. Jakobson, S. D. Miller, Z. Rudnick, R. Rivin 23
25 Toeplitz Ensembles A Toeplitz matrix is of the form b 0 b 1 b 2 b N 1 b 1 b 0 b 1 b N 2 b 2 b 1 b 0 b N b 1 N b 2 N b 3 N b 0 Will consider Symmetric Toeplitz. Main diagonal zero, N independent parameters. Normalize Eigenvalues by N. 24
26 Eigenvalue Density Measure µ A,N (x)dx = 1 N N i=1 δ ( x λ i(a) N ) dx. The k th moment of µ A,N (x) is M k (A, N) = 1 N k 2 +1 N i=1 λ k i (A). Let M k (N) = lim M k(a, N). N 25
27 N, M 0 (N) = 1. k = 0, 2 and k odd For k = 2: as a ij = b i j : M 2 (N) = 1 N 2 = 1 N 2 1 i 1,i 2 N 1 i 1,i 2 N E(b i1 i 2 b i 2 i 1 ) E(b 2 i 1 i 2 ). N 2 N times get 1, N times 0. Therefore M 2 (N) = 1 1 N. Trivial counting: odd moments 0. 26
28 M 2k (N) = 1 N k+1 Even Moments 1 i 1,,i 2k N Main Term: b j s matched in pairs, say E(b i1 i 2 b i2 i 3 b i2k i 1 ). b im i m+1 = b in i n+1, x m = i m i m+1 = i n i n+1. Two possibilities: i m i m+1 = i n i n+1 or i m i m+1 = (i n i n+1 ). (2k 1)!! ways to pair, 2 k choices of sign. 27
29 Main Term: All Signs Neg M 2k (N) = 1 N k+1 1 i 1,,i 2k N E(b i1 i 2 b i2 i 3 b i2k i 1 ). Let x 1,..., x k be the values of the i j i j+1 s. Let ɛ 1,..., ɛ k be the choices of sign. Define x 1 = i 1 i 2, x 2 = i 2 i 3,... Therefore i 2 = i 1 x 1 i 3 = i 1 x 1 x 2. i 1 = i 1 x 1 x 2k. x x 2k = k (1 + ɛ j )η j x j = 0, η j = ±1. j=1 28
30 Even Moments: Summary Main Term: paired, all signs negative. M 2k (N) (2k 1)!! + O k ( 1 N ). Bounded by Gaussian. 29
31 The Fourth Moment M 4 (N) = 1 N 3 Let x j = i j i j+1. 1 i 1,i 2,i 3,i 4 N E(b i1 i 2 b i2 i 3 b i3 i 4 b i4 i 1 ) Case One: x 1 = x 2, x 3 = x 4 : i 1 i 2 = (i 2 i 3 ) and i 3 i 4 = (i 4 i 1 ). i 1 = i 3, i 2 and i 4 are arbitrary. Left with E[b 2 x 1 b 2 x 3 ]. N 3 N times get 1, N times get p 4 = E[b 4 x 1 ]. 30
32 Diophantine Obstruction M 4 (N) = 1 N 3 1 i 1,i 2,i 3,i 4 N E(b i1 i 2 b i2 i 3 b i3 i 4 b i4 i 1 ) Case Two: x 1 = x 3 and x 2 = x 4. i 1 i 2 = (i 3 i 4 ) and i 2 i 3 = (i 4 i 1 ). This yields i 1 = i 2 + i 4 i 3, i 1, i 2, i 3, i 4 {1,..., N}. If i 2, i 4 2N 3 and i 3 < N 3, i 1 > N: at most ( )N 3 valid choices. 31
33 Fourth Moment: Answer Theorem: Fourth Moment: Let p 4 be the fourth moment of p. Then M 4 (N) = 2 2 ( ) O p 4. N 500 Toeplitz Matrices,
34 Higher Moments M 6 (N) = 11 (Gaussian s is 15). M 8 (N) = (Gaussian s is 105). For sixth moment, five configurations: Occur (respectively) 2, 6, 3, 3 and 1 time. Lemma: For 2k 4, lim N M 2k (N) < (2k 1)!!. 33
35 Lower Bound of High Moments unbounded support: a lower bound L 2k such that lim k 2k L 2k =. 1 N k+1e N i 1 =1 N i 2k =1 b i1 i 2 b i 2 i 3 b i 2k i 1. Matched in k pairs, matchings must occur with negative signs. Denote positive differences of i n i n+1 by x 1,..., x k. Let x j = i j i j+1 ; k are positive (negative) k + 1 degrees of freedom: k differences x j, and any index, say i 1. 34
36 Lower Bound of High Moments (II) i 2 = i 1 x 1 i 3 = i 1 x 1 x 2. i 2k = i 1 x 1 x 2k. Once specify i 1 and x 1 through x 2k, all indices are determined. If matched in pairs and each i j {1,..., N}, have a valid configuration, contributes +1. Problem: a running sum i 1 x 1 x m {1,..., N} 35
37 Lower Bound of High Moments (III) α ( 1 2, 1), I A = {1,..., A} where A = N k α. Choose each difference x j from I A : A k ways, to first order distinct. Put half of positive x j s and and non-matching negatives in first half ( x 1,..., x k ). Have not specified the order of the differences, just how many positive (negative) are in the first half / second half. Two different k-tuples of differences x j cannot give rise to the same configuration (if we assume the differences are distinct). 36
38 Lower Bound of High Moments (IV) Assume have ordered ( the ) positive differences in first half. There are k2! ways to relatively order corresponding negatives in second half. ( ) If ordered the negatives in first half, k2! ways to relatively order positives in second half. Still have freedom on how to intersperse positives and negatives in second half. "Most" configurations can be made valid by Central Limit Theorem. 37
39 Lower Bound of High Moments (V) Regard the x p s ( x n s) as iidrv from I A ( I A ) with mean 1 2 A ( 1 2A) and standard deviation A. CLT: sum of the k 2 positive (negative) x ps ( x n s) in the first block converges to Gaussian, mean ka 4 ( ka 4 ) and standard deviation k2 A 2 3. N, k large, at least 4 1Ak have positive sum in [ ka ka 4 2 6, ka ] ka (and similarly for negative sum). Freedom to choose how to intersperse the positives and negatives in the first and second halves. Keep running sum small: can ensure at most ( ) ka max 2A, Intersperse same way in second half. 38
40 If i 1 Lower Bound of High Moments (VI) [ ] 7 N 8, all indices in {1,..., N}. k α 1 2, N k α 1 2 Number of configurations giving 1 is at least ( ) ( ( ) 1 N 1 k 8 4 Ak )A k 1 (k/2)! 2. 2 k α 1 2 Divide by N k+1, recall A = N k α, main term: 1 32N k+1 N k+1 k kα 1 2 2k th root looks like ( ) e k 2 log k 2 πk 3 2 k 2 2 2π(k/2) = 16e (1+log 2)k e(1 α)k log k. e(1 α) log k e 1+log 2 > O(k 1 α ), proving the support is unbounded; 2k th root of Gaussian moment is k e. 39
41 Decay of Higher Moments 40
42 Poissonian Behavior? Not rescaled. Looking at middle 11 spacings, 1000 Toeplitz matrices ( ), entries iidrv from the standard normal. 41
43 Real Symmetric Palindromic Toeplitz b 0 b 1 b 2 b 3 b 3 b 2 b 1 b 0 b 1 b 0 b 1 b 2 b 4 b 3 b 2 b 1 b 2 b 1 b 0 b 1 b 5 b 4 b 3 b 2 b 3 b 2 b 1 b 0 b 6 b 5 b 4 b b 3 b 4 b 5 b 6 b 0 b 1 b 2 b 3 b 2 b 3 b 4 b 5 b 1 b 0 b 1 b 2 b 1 b 2 b 3 b 4 b 2 b 1 b 0 b 1 b 0 b 1 b 2 b 3 b 3 b 2 b 1 b 0 Extra symmetry seems to fix Diophantine Obstructions. Always have eigenvalue at 0. 42
44 Real Symmetric Palindromic Toeplitz (cont) Real Symmetric Palindromic Toeplitz, Note the bump at the zeroth bin is due to the forced eigenvalues at 0. 43
45 Summary Ensemble Degrees of Freedom Density Spacings Real Symm O(N 2 ) Semi-Circle GOE Diagonal O(N) p(x) Poisson d-regular O(dN) Kesten GOE Toeplitz O(N) Toeplitz Poisson Palindromic Toeplitz O(N) Gaussian Red is conjectured Blue is new Maroon: Partial Results (first 9 moments) 44
46 Summary (Toeplitz) Converges (in some sense) to new universal distribution, independent of p; Moments bounded by those of Gaussian; Ratio tends to 0, but unbounded support; Can interpret as Diophantine Obstructions (Hammond-Miller) or volumes of Euler solids (Bryc-Dembo-Jiang). Real Symmetric Palindromic Toeplitz looks Gaussian (Miller-Ramey-Sinsheimer-Teich). 45
DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES
DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES ADAM MASSEY, STEVEN J. MILLER, AND JOHN SINSHEIMER Abstract. Consider the ensemble of real symmetric Toeplitz
More informationEigenvalue Statistics for Toeplitz and Circulant Ensembles
Eigenvalue Statistics for Toeplitz and Circulant Ensembles Murat Koloğlu 1, Gene Kopp 2, Steven J. Miller 1, and Karen Shen 3 1 Williams College 2 University of Michigan 3 Stanford University http://www.williams.edu/mathematics/sjmiller/
More informationDISTRIBUTION OF EIGENVALUES FOR THE ENSEMBLE OF REAL SYMMETRIC TOEPLITZ MATRICES
DISTRIBUTIO OF EIGEVALUES FOR THE ESEMBLE OF REAL SYMMETRIC TOEPLITZ MATRICES CHRISTOPHER HAMMOD AD STEVE J. MILLER Abstract. Consider the ensemble of real symmetric Toeplitz matrices, each independent
More informationDistribution of Eigenvalues for the Ensemble of Real Symmetric Toeplitz Matrices
Journal of Theoretical Probability, Vol. 18, No. 3, July 2005 ( 2005) DOI: 10.1007/s10959-005-3518-5 Distribution of Eigenvalues for the Ensemble of Real Symmetric Toeplitz Matrices Christopher Hammond
More informationLow-lying zeros of GL(2) L-functions
Low-lying zeros of GL(2) L-functions Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/mathematics/sjmiller/ Group, Lie and Number Theory Seminar University of Michigan,
More informationDistribution of Eigenvalues of Weighted, Structured Matrix Ensembles
Distribution of Eigenvalues of Weighted, Structured Matrix Ensembles Olivia Beckwith 1, Steven J. Miller 2, and Karen Shen 3 1 Harvey Mudd College 2 Williams College 3 Stanford University Joint Meetings
More informationOn the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges
On the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges Leo Goldmakher 8 Frist Campus Ctr. Unit 0817 Princeton University Princeton, NJ 08544 September 2003 Abstract
More informationFollow links Class Use and other Permissions. For more information, send to:
COPYRIGHT NOTICE: Steven J. Miller and Ramin Takloo-Bighash: An Invitation to Modern Number Theory is published by Princeton University Press and copyrighted, 006, by Princeton University Press. All rights
More informationA Generalization of Wigner s Law
A Generalization of Wigner s Law Inna Zakharevich June 2, 2005 Abstract We present a generalization of Wigner s semicircle law: we consider a sequence of probability distributions (p, p 2,... ), with mean
More informationLIMITING SPECTRAL MEASURES FOR RANDOM MATRIX ENSEMBLES WITH A POLYNOMIAL LINK FUNCTION
LIMITING SPECTRAL MEASURES FOR RANDOM MATRIX ENSEMBLES WITH A POLYNOMIAL LINK FUNCTION by KIRK SWANSON STEVEN J. MILLER, ADVISOR A thesis submitted in partial fulfillment of the requirements for the Degree
More informationFrom the Manhattan Project to Elliptic Curves: Introduction to Random Matrix Theory
From the Manhattan Project to Elliptic Curves: Introduction to Random Matrix Theory Steven J Miller Dept of Math/Stats, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu http://www.williams.edu/mathematics/sjmiller
More informationarxiv: v2 [math.pr] 31 Aug 2010
DISTRIBUTION OF EIGENVALUES OF HIGHLY PALINDROMIC TOEPLITZ MATRICES STEVEN JACKSON, STEVEN J. MILLER, AND THUY PHAM arxiv:1003.2010v2 [math.pr] 31 Aug 2010 Abstract. Consider the ensemble of real symmetric
More informationFluctuations from the Semicircle Law Lecture 1
Fluctuations from the Semicircle Law Lecture 1 Ioana Dumitriu University of Washington Women and Math, IAS 2014 May 20, 2014 Ioana Dumitriu (UW) Fluctuations from the Semicircle Law Lecture 1 May 20, 2014
More informationDISTRIBUTION OF EIGENVALUES OF WEIGHTED, STRUCTURED MATRIX ENSEMBLES. Olivia Beckwith Department of Mathematics, Emory University, Atlanta, Georgia
#A2 INTEGERS 5 (205) DISTRIBUTION OF EIGENVALUES OF WEIGHTED, STRUCTURED MATRIX ENSEMBLES Olivia Beckwith Department of Mathematics, Emory University, Atlanta, Georgia Victor Luo Dept of Math & Stats,
More informationarxiv: v2 [math.pr] 2 Nov 2009
arxiv:0904.2958v2 [math.pr] 2 Nov 2009 Limit Distribution of Eigenvalues for Random Hankel and Toeplitz Band Matrices Dang-Zheng Liu and Zheng-Dong Wang School of Mathematical Sciences Peking University
More informationLocal Kesten McKay law for random regular graphs
Local Kesten McKay law for random regular graphs Roland Bauerschmidt (with Jiaoyang Huang and Horng-Tzer Yau) University of Cambridge Weizmann Institute, January 2017 Random regular graph G N,d is the
More informationNumber Theory and Probability
Number Theory and Probability Nadine Amersi, Thealexa Becker, Olivia Beckwith, Alec Greaves-Tunnell, Geoffrey Iyer, Oleg Lazarev, Ryan Ronan, Karen Shen, Liyang Zhang Advisor Steven Miller (sjm1@williams.edu)
More informationRandom Matrices: Beyond Wigner and Marchenko-Pastur Laws
Random Matrices: Beyond Wigner and Marchenko-Pastur Laws Nathan Noiry Modal X, Université Paris Nanterre May 3, 2018 Wigner s Matrices Wishart s Matrices Generalizations Wigner s Matrices ij, (n, i, j
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More informationLecture 1: Systems of linear equations and their solutions
Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications
More informationFrom Random Matrix Theory to Number Theory
From Random Matrix Theory to Number Theory Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ Graduate Workshop on Zeta Functions, L-Functions and their
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 informationThe Free Central Limit Theorem: A Combinatorial Approach
The Free Central Limit Theorem: A Combinatorial Approach by Dennis Stauffer A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 4301 (Honour s Seminar)
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More information1. Let A be a 2 2 nonzero real matrix. Which of the following is true?
1. Let A be a 2 2 nonzero real matrix. Which of the following is true? (A) A has a nonzero eigenvalue. (B) A 2 has at least one positive entry. (C) trace (A 2 ) is positive. (D) All entries of A 2 cannot
More informationWigner s semicircle law
CHAPTER 2 Wigner s semicircle law 1. Wigner matrices Definition 12. A Wigner matrix is a random matrix X =(X i, j ) i, j n where (1) X i, j, i < j are i.i.d (real or complex valued). (2) X i,i, i n are
More informationBulk scaling limits, open questions
Bulk scaling limits, open questions Based on: Continuum limits of random matrices and the Brownian carousel B. Valkó, B. Virág. Inventiones (2009). Eigenvalue statistics for CMV matrices: from Poisson
More informationMath 341: Probability Eighteenth Lecture (11/12/09)
Math 341: Probability Eighteenth Lecture (11/12/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More informationStatistical Investigations as a Tool in Undergraduate Mathematics Research
TEACHING OF STATISTICS HONOLULU, JUNE 5, 2003 Statistical Investigations as a Tool in Undergraduate Mathematics Research Steven J. Miller, Leo Goldmakher, Atul Pokharel Department of Mathematics, Princeton
More informationRandom matrix pencils and level crossings
Albeverio Fest October 1, 2018 Topics to discuss Basic level crossing problem 1 Basic level crossing problem 2 3 Main references Basic level crossing problem (i) B. Shapiro, M. Tater, On spectral asymptotics
More informationOn the concentration of eigenvalues of random symmetric matrices
On the concentration of eigenvalues of random symmetric matrices Noga Alon Michael Krivelevich Van H. Vu April 23, 2012 Abstract It is shown that for every 1 s n, the probability that the s-th largest
More informationRandom Toeplitz Matrices
Arnab Sen University of Minnesota Conference on Limits Theorems in Probability, IISc January 11, 2013 Joint work with Bálint Virág What are Toeplitz matrices? a0 a 1 a 2... a1 a0 a 1... a2 a1 a0... a (n
More informationMath 313 Chapter 1 Review
Math 313 Chapter 1 Review Howard Anton, 9th Edition May 2010 Do NOT write on me! Contents 1 1.1 Introduction to Systems of Linear Equations 2 2 1.2 Gaussian Elimination 3 3 1.3 Matrices and Matrix Operations
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 informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationLectures 2 3 : Wigner s semicircle law
Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j=1 be a symmetric n n matrix with Random entries
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 informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationarxiv: v2 [math.pr] 16 Aug 2014
RANDOM WEIGHTED PROJECTIONS, RANDOM QUADRATIC FORMS AND RANDOM EIGENVECTORS VAN VU DEPARTMENT OF MATHEMATICS, YALE UNIVERSITY arxiv:306.3099v2 [math.pr] 6 Aug 204 KE WANG INSTITUTE FOR MATHEMATICS AND
More informationPhysics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory
Physics 202 Laboratory 5 Linear Algebra Laboratory 5 Physics 202 Laboratory We close our whirlwind tour of numerical methods by advertising some elements of (numerical) linear algebra. There are three
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More informationLimit Laws for Random Matrices from Traffic Probability
Limit Laws for Random Matrices from Traffic Probability arxiv:1601.02188 Slides available at math.berkeley.edu/ bensonau Benson Au UC Berkeley May 9th, 2016 Benson Au (UC Berkeley) Random Matrices from
More informationFree Probability Theory and Random Matrices. Roland Speicher Queen s University Kingston, Canada
Free Probability Theory and Random Matrices Roland Speicher Queen s University Kingston, Canada What is Operator-Valued Free Probability and Why Should Engineers Care About it? Roland Speicher Queen s
More informationWhat is the Riemann Hypothesis for Zeta Functions of Irregular Graphs?
What is the Riemann Hypothesis for Zeta Functions of Irregular Graphs? Audrey Terras Banff February, 2008 Joint work with H. M. Stark, M. D. Horton, etc. Introduction The Riemann zeta function for Re(s)>1
More informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 31 OCTOBER 2018
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY OCTOBER 8 Mark Scheme: Each part of Question is worth marks which are awarded solely for the correct answer. Each
More informationOn level crossing in deterministic and random matrix pencils
On level crossing in deterministic and random matrix pencils May 3, 2018 Topics to discuss 1 Basic level crossing problem 2 3 4 Main references (i) B. Shapiro, M. Tater, On spectral asymptotics of quasi-exactly
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 informationRandom Matrices: Invertibility, Structure, and Applications
Random Matrices: Invertibility, Structure, and Applications Roman Vershynin University of Michigan Colloquium, October 11, 2011 Roman Vershynin (University of Michigan) Random Matrices Colloquium 1 / 37
More information1 Positive definiteness and semidefiniteness
Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +
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 informationQuantum chaos on graphs
Baylor University Graduate seminar 6th November 07 Outline 1 What is quantum? 2 Everything you always wanted to know about quantum but were afraid to ask. 3 The trace formula. 4 The of Bohigas, Giannoni
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
More informationThe n th moment M n of a RV X is defined to be E(X n ), M n = E(X n ). Andrew Dabrowski
We ll get to the in a few slides, but first some preliminaries. The tool we need to prove the is the sequence of moments of a probability distribution. We ll get to the in a few slides, but first some
More informationSection 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.
Section 9.2: Matrices Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns. That is, a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn A
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 informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More information1 Intro to RMT (Gene)
M705 Spring 2013 Summary for Week 2 1 Intro to RMT (Gene) (Also see the Anderson - Guionnet - Zeitouni book, pp.6-11(?) ) We start with two independent families of R.V.s, {Z i,j } 1 i
More informationAsymptotic Behavior of the Random 3-Regular Bipartite Graph
Asymptotic Behavior of the Random 3-Regular Bipartite Graph Tim Novikoff Courant Institute New York University, 10012 December 17,2002 Abstract In 2001, two numerical experiments were performed to observe
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationEstimation of large dimensional sparse covariance matrices
Estimation of large dimensional sparse covariance matrices Department of Statistics UC, Berkeley May 5, 2009 Sample covariance matrix and its eigenvalues Data: n p matrix X n (independent identically distributed)
More informationFreeness and the Transpose
Freeness and the Transpose Jamie Mingo (Queen s University) (joint work with Mihai Popa and Roland Speicher) ICM Satellite Conference on Operator Algebras and Applications Cheongpung, August 8, 04 / 6
More informationDISTRIBUTION OF EIGENVALUES OF WEIGHTED, STRUCTURED MATRIX ENSEMBLES
DISTRIBUTION OF EIGENVALUES OF WEIGHTED, STRUCTURED MATRIX ENSEMBLES OLIVIA BECKWITH, VICTOR LUO, STEVEN J. MILLER, KAREN SHEN, AND NICHOLAS TRIANTAFILLOU ABSTRACT. The study of the limiting distribution
More informationLectures 2 3 : Wigner s semicircle law
Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j= be a symmetric n n matrix with Random entries
More informationChapter 1: Systems of Linear Equations and Matrices
: Systems of Linear Equations and Matrices Multiple Choice Questions. Which of the following equations is linear? (A) x + 3x 3 + 4x 4 3 = 5 (B) 3x x + x 3 = 5 (C) 5x + 5 x x 3 = x + cos (x ) + 4x 3 = 7.
More informationMeixner matrix ensembles
Meixner matrix ensembles W lodek Bryc 1 Cincinnati April 12, 2011 1 Based on joint work with Gerard Letac W lodek Bryc (Cincinnati) Meixner matrix ensembles April 12, 2011 1 / 29 Outline of talk Random
More informationLecture 5: Linear models for classification. Logistic regression. Gradient Descent. Second-order methods.
Lecture 5: Linear models for classification. Logistic regression. Gradient Descent. Second-order methods. Linear models for classification Logistic regression Gradient descent and second-order methods
More informationBasic Properties of Metric and Normed Spaces
Basic Properties of Metric and Normed Spaces Computational and Metric Geometry Instructor: Yury Makarychev The second part of this course is about metric geometry. We will study metric spaces, low distortion
More informationAbsolutely continuous spectrum for random Schrödinger operators on tree-strips of finite cone type.
Absolutely continuous spectrum for random Schrödinger operators on tree-strips of finite cone type. Christian Sadel University of California, Irvine Tucson, March 13th, 2012 C. Sadel (UCI) AC Spectrum
More informationU.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018
U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationUnderstand Primes and Elliptic Curves. How the Manhattan Project Helps us. From Nuclear Physics to Number Theory
From Nuclear Physics to Number Theory How the Manhattan Project Helps us Understand Primes and Elliptic Curves Steven J. Miller Brown University University of Connecticut, March 24 th, 2005 http://www.math.brown.edu/
More informationMATH 2030: EIGENVALUES AND EIGENVECTORS
MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their
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 informationCombinatorial and physical content of Kirchhoff polynomials
Combinatorial and physical content of Kirchhoff polynomials Karen Yeats May 19, 2009 Spanning trees Let G be a connected graph, potentially with multiple edges and loops in the sense of a graph theorist.
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 informationInternational Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994
International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible
More informationApplications of random matrix theory to principal component analysis(pca)
Applications of random matrix theory to principal component analysis(pca) Jun Yin IAS, UW-Madison IAS, April-2014 Joint work with A. Knowles and H. T Yau. 1 Basic picture: Let H be a Wigner (symmetric)
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
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 informationEIGENVALUE SPACINGS FOR REGULAR GRAPHS. 1. Introduction
EIGENVALUE SPACINGS FOR REGULAR GRAPHS DMITRY JAKOBSON, STEPHEN D. MILLER, IGOR RIVIN AND ZEÉV RUDNICK Abstract. We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments
More informationRandom Variables. P(x) = P[X(e)] = P(e). (1)
Random Variables Random variable (discrete or continuous) is used to derive the output statistical properties of a system whose input is a random variable or random in nature. Definition Consider an experiment
More informationRoot systems and optimal block designs
Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question
More informationNorms of Random Matrices & Low-Rank via Sampling
CS369M: Algorithms for Modern Massive Data Set Analysis Lecture 4-10/05/2009 Norms of Random Matrices & Low-Rank via Sampling Lecturer: Michael Mahoney Scribes: Jacob Bien and Noah Youngs *Unedited Notes
More informationIntroduction to Instantons. T. Daniel Brennan. Quantum Mechanics. Quantum Field Theory. Effects of Instanton- Matter Interactions.
February 18, 2015 1 2 3 Instantons in Path Integral Formulation of mechanics is based around the propagator: x f e iht / x i In path integral formulation of quantum mechanics we relate the propagator to
More informationPolynomials in Free Variables
Polynomials in Free Variables Roland Speicher Universität des Saarlandes Saarbrücken joint work with Serban Belinschi, Tobias Mai, and Piotr Sniady Goal: Calculation of Distribution or Brown Measure of
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 information1300 Linear Algebra and Vector Geometry
1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Matrix Inversion Algorithm One payoff from this theorem: It gives us a way to invert matrices.
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 8 Luca Trevisan September 19, 2017
U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 8 Luca Trevisan September 19, 2017 Scribed by Luowen Qian Lecture 8 In which we use spectral techniques to find certificates of unsatisfiability
More informationk th -order Voronoi Diagrams
k th -order Voronoi Diagrams References: D.-T. Lee, On k-nearest neighbor Voronoi Diagrams in the plane, IEEE Transactions on Computers, Vol. 31, No. 6, pp. 478 487, 1982. B. Chazelle and H. Edelsbrunner,
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More informationSpecial Number Theory Seminar From Random Matrix Theory to L-Functions
Special Number Theory Seminar From Random Matrix Theory to L-Functions Steven J. Miller Brown University December 23, 2004 http://www.math.brown.edu/ sjmiller/math/talks/talks.html Origins of Random Matrix
More informationCOS Lecture 16 Autonomous Robot Navigation
COS 495 - Lecture 16 Autonomous Robot Navigation Instructor: Chris Clark Semester: Fall 011 1 Figures courtesy of Siegwart & Nourbakhsh Control Structure Prior Knowledge Operator Commands Localization
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J. Miller (MC 96) http://www.williams.edu/mathematics/sjmiller/public_html Yale University, April 14, 2014 Introduction Goals of the
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More information