The Random Matrix Technique of Ghosts and Shadows Alan Edelman Dept of Mathematics Computer Science and AI Laboratories Massachusetts Institute of Technology.

Slides:



Advertisements
Similar presentations
Chapter 0 Review of Algebra.
Advertisements

Chapter 6 Matrix Algebra.
Applied Informatics Štefan BEREŽNÝ
Singular Values of the GUE Surprises that we Missed Alan Edelman and Michael LaCroix MIT June 16, 2014 (acknowledging gratefully the help from Bernie Wang)
ME751 Advanced Computational Multibody Dynamics Section 9.2 February 2, 2010 © Dan Negrut, 2010 ME751, UW-Madison “My own business always bores me to death;
Modeling and Simulation Monte carlo simulation 1 Arwa Ibrahim Ahmed Princess Nora University.
Random Matrices, Integrals and Space-time Systems Babak Hassibi California Institute of Technology DIMACS Workshop on Algebraic Coding and Information.
Mathematics. Matrices and Determinants-1 Session.
Determinants Bases, linear Indep., etc Gram-Schmidt Eigenvalue and Eigenvectors Misc
Random Matrices Hieu D. Nguyen Rowan University Rowan Math Seminar
Chapter 6 Eigenvalues.
Now Playing: My Mathematical Mind Spoon From Gimme Fiction Released May 10, 2005.
Lecture 2 Probability and what it has to do with data analysis.
Lecture 4 Probability and what it has to do with data analysis.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Modern Navigation Thomas Herring
Copyright © Cengage Learning. All rights reserved. 7.6 The Inverse of a Square Matrix.
Needle-like Triangles, Matrices, and Lewis Carroll Alan Edelman Mathematics Computer Science & AI Labs Gilbert Strang Mathematics Computer Science & AI.
Introduction Information in science, business, and mathematics is often organized into rows and columns to form rectangular arrays called “matrices” (plural.
Orthogonal Matrices and Spectral Representation In Section 4.3 we saw that n  n matrix A was similar to a diagonal matrix if and only if it had n linearly.
ME751 Advanced Computational Multibody Dynamics Introduction January 21, 2010 Dan Negrut University of Wisconsin, Madison © Dan Negrut, 2010 ME751, UW-Madison.
Copyright © Cengage Learning. All rights reserved.
1 Fundamental Concepts of Algebra 1.1 Real Numbers
Angles Type of angle: Acute: An Angle less than 90 degrees Right angle: An angle that is 90 degrees Obtuse angle: An angle more than 90 degrees Straight.
1 1.0 Students solve equations and inequalities involving absolute value. Algebra 2 Standards.
Random Matrix Theory Numerical Computation and Remarkable Applications Alan Edelman Mathematics Computer Science & AI Labs Computer Science & AI Laboratories.
Fields Institute Talk Note first half of talk consists of blackboard – see video: – then I.
Chapter 10 Review: Matrix Algebra
Compiled By Raj G. Tiwari
Random Matrix Theory and Numerical Linear Algebra: A story of communication Alan Edelman Mathematics Computer Science & AI Labs ILAS Meeting June 3, 2013.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
ECON 1150 Matrix Operations Special Matrices
Eigenvalue Problems Solving linear systems Ax = b is one part of numerical linear algebra, and involves manipulating the rows of a matrix. The second main.
Mathematics for Computer Graphics (Appendix A) Won-Ki Jeong.
Systems of Linear Equation and Matrices
Matrix Algebra. Quick Review Quick Review Solutions.
Percentile Approximation Via Orthogonal Polynomials Hyung-Tae Ha Supervisor : Prof. Serge B. Provost.
Alan Edelman Oren Mangoubi, Bernie Wang Mathematics
ECE 8443 – Pattern Recognition LECTURE 03: GAUSSIAN CLASSIFIERS Objectives: Normal Distributions Whitening Transformations Linear Discriminants Resources.
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
What are the Eigenvalues of a Sum of (Non-Commuting) Random Symmetric Matrices? : A "Quantum Information" inspired Answer. Alan Edelman Ramis Movassagh.
DISCRETE COMPUTATIONAL STRUCTURES CS Fall 2005.
Properties of Real Numbers. Sets In mathematics, a set is a collection of things Sets can be studies as a topic all on its own (known as set theory),
SUPA Advanced Data Analysis Course, Jan 6th – 7th 2009 Advanced Data Analysis for the Physical Sciences Dr Martin Hendry Dept of Physics and Astronomy.
David Renardy.  Simple Group- A nontrivial group whose only normal subgroups are itself and the trivial subgroup.  Simple groups are thought to be classified.
A Review of Some Fundamental Mathematical and Statistical Concepts UnB Mestrado em Ciências Contábeis Prof. Otávio Medeiros, MSc, PhD.
Serge Andrianov Theory of Symplectic Formalism for Spin-Orbit Tracking Institute for Nuclear Physics Forschungszentrum Juelich Saint-Petersburg State University,
M ONTE C ARLO SIMULATION Modeling and Simulation CS
Stats Probability Theory Summary. The sample Space, S The sample space, S, for a random phenomena is the set of all possible outcomes.
What is the determinant of What is the determinant of
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
Great Theoretical Ideas in Computer Science.
1. Systems of Linear Equations and Matrices (8 Lectures) 1.1 Introduction to Systems of Linear Equations 1.2 Gaussian Elimination 1.3 Matrices and Matrix.
Progress in the method of Ghosts and Shadows for Beta Ensembles Alan Edelman (MIT) Alex Dubbs (MIT) and Plamen Koev (SJS) Aug 10, 2012 IMS Singapore Workshop.
Linear Algebra Chapter 2 Matrices.
Review of statistical modeling and probability theory Alan Moses ML4bio.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 14: Applications of Filters.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
ALGEBRAIC EIGEN VALUE PROBLEMS
Alan Edelman Ramis Movassagh July 14, 2011 FOCM Random Matrices
Stochastic Differential Equations and Random Matrices
Numerical Computations and Random Matrix Theory
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Advances in Random Matrix Theory (stochastic eigenanalysis)
Advances in Random Matrix Theory (stochastic eigenanalysis)
Why are random matrix eigenvalues cool?
Numerical Computations and Random Matrix Theory
Advances in Random Matrix Theory: Let there be tools
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Presentation transcript:

The Random Matrix Technique of Ghosts and Shadows Alan Edelman Dept of Mathematics Computer Science and AI Laboratories Massachusetts Institute of Technology (with thanks to Plamen Koev)

Short followed by the Movie Some interesting computational techniques – Random Matrix Theory = Theorems, Applications, and Software A new application can be more valuable than a theorem! A well crafted experiment or package is not a theorem but it can be as important or even more to the field! The Main Show: The Method of Ghosts and Shadows in Random Matrix Theory – Yet another nail in the threefold way “coffin”

Semi-Circle Law Naïve Way: MATLAB®: A=randn(n); S=(A+A’)/sqrt(2*n);eig(S) R: A=matrix(rnorm(n*n),ncol=n);S=(a+t(a))/sqrt(2*n);eigen(S,symmetric=T,only.values=T)$values; Mathematica: A=RandomArray[NormalDistribution[],{n,n}];S=(A+Transpose[A])/Sqrt[n];Eigenvalues[s]

Compute All the Eigenvalues Sym Tridiagonal: β=1:real, β=2:complex, β=4:quaternion, β=2½? Diagonals N(0,2), Off-diagonals “chi” random-variables : N=2000: 12 seconds vs. 0.2 seconds (factor of 60!!) (Dumitriu & E: 2002)

Histogram without Histogramming: Sturm Sequences Count #eigs < 0.5: Count sign changes in Det (A-0.5*I)[1:k,1:k] Count #eigs in [x,x+h] Take difference in number of sign changes at x+h and x Mentioned in Dumitriu and E 2006, Used theoretically in Albrecht, Chan, and E 2008

A good computational trick is a good theoretical trick! Finite Semi-Circle Laws for Any Beta! Finite Tracy-Widom Laws for Any Beta!

Stochastic Differential Eigen-Equations Tridiagonal Models Suggest SDE’s with Brownian motion as infinite limit: – E: 2002 – E and Sutton 2005, 2007 – Brian Rider and (Ramirez, Cambronero, Virag, etc.) (Lots of beautiful results!) – (Not today’s talk)

“Tracy-Widom” Computations Eigenvalues without the whole matrix! E: 2003 Persson and E: 2005 Never construct the entire tridiagonal matrix! Just say the upper 10n 1/3 by 10n 1/3 Compute largest eigenvalue of that, perhaps using Lanczos with shift and invert strategy! Can compute for n amazingly large!!!!! And any beta.

Other Computational Results Infinite Random Matrix Theory – The Free Probability Calculator (Raj) Finite Random Matrix Theory – MOPS (Ioana Dumitriu) (β: orthogonal polynomials) – Hypergeometrics of Matrix Argument (Plamen Koev) (β: distribution functions for finite stats such as the finite Tracy-Widom laws for Laguerre) Good stuff, but not today.

Ghosts and Shadows

Scary Ideas in Mathematics Zero Negative Radical Irrational Imaginary Ghosts: Something like a commutative algebra of random variables that generalizes Reals, Complexes, and Quaternions and inspires theoretical results and numerical computation

RMT Densities Hermite: c ∏|λ i - λ j | β e -∑λ i 2 /2 (Gaussian Ensemble) Laguerre: c ∏|λ i -λ j | β ∏λ i m e -∑λ i (Wishart Matrices) Jacobi: c ∏|λ i -λ j | β ∏λ i m 1 ∏(1-λ i ) m 2 (Manova Matrices) Fourier: c ∏|λ i -λ j | β (on the complex unit circle) “Jack Polynomials” Traditional Story: Count the real parameters β=1,2,4 for real, complex, quaternion Applications: β=1: All of Multivariate Statistics β=2:parked cars in London, wireless networks β=4: There and almost nobody cares Dyson 1962 “Threefold Way” Three Division Rings

β-Ghosts β=1 has one real Gaussian (G) β=2 has two real Gaussians (G+iG) β=4 has four real Gaussians (G+iG+jG+kG) β≥1 has one real part and (β-1) “Ghost” parts

Introductory Theory There is an advanced theory emerging (some other day) Informally: – A β-ghost is a spherically symmetric random variable defined on R β – A shadow is a derived real or complex quantity

Goals Continuum of Haar Measureas generalizing orthogonal, unitary, symplectic New Definition of Jack Polynomials generalizing the zonals Computations! E.g. Moments of the Haar Measures Place finite random matrix theory “β”into same framework as infinite random matrix theory: specifically β as a knob to turn down the randomness, e.g. Airy Kernel –d 2 /dx 2 +x+(2/β ½ )dW  White Noise

Formally Let S n =2π/Γ(n/2)=“suface area of sphere” Defined at any n= β>0. A β-ghost x is formally defined by a function f x (r) such that ∫ ∞ f x (r) r β-1 S β-1 dr=1. Note: For β integer, the x can be realized as a random spherically symmetric variable in β dimensions Example: A β-normal ghost is defined by f(r)=(2π) -β/2 e - r 2 /2 Example: Zero is defined with constant*δ(r). Can we do algebra? Can we do linear algebra? Can we add? Can we multiply? r=0

A few more operations ΙΙxΙΙ is a real random variable whose density is given by f x (r) (x+x’)/2 is real random variable given by multiplying ΙΙxΙΙ by a beta distributed random variable representing a coordinate on the sphere

Representations I’ve tried a few on for size. My favorite right now is – A complex number z with ΙΙzΙΙ, the radius and Re(z), the real part. Addition of Independent Ghosts: Addition returns a spherically symmetric object Have an integral formula Prefer: Add the real part, imaginary part completed to keep spherical symmetry

Multiplication of Independent Ghosts Just multiply ΙΙzΙΙ’s and plug in spherical symmetry Multiplication is commutative – (Important Example: Quaternions don’t commute, but spherically symmetric random variables do!)

Shadow Example Given a ghost Gaussian, G β, the length is a real chi-beta variable χ β variable.

Linear Algebra Example Given a ghost Gaussian, G β, the length is a real chi-beta variable χ β variable. Gram-Schmidt:    or = [Q] * GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ χ3βχ3β GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ χ3βχ3β GβGβ GβGβ χ 2β GβGβ GβGβ χ3βχ3β GβGβ GβGβ GβGβ ΧβΧβ H3H3 H2H2 H1H1 GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ χ3βχ3β GβGβ GβGβ GβGβ ΧβΧβ Q has β - Haar Measure! We have computed moments! (more later)

Tridiagonalizing Example GβGβ GβGβ GβGβ …GβGβ GβGβ GβGβ GβGβ …GβGβ GβGβ GβGβ GβGβ …GβGβ GβGβ GβGβ GβGβ GβGβ GβGβ  Symmetric Part of

Understanding ∏|λ i -λ j | β Define volume element (dx)^ by (r dx)^=r β (dx)^ (β-dim volume, like fractals, but don’t really see any fractal theory here) Jacobians: A=QΛQ’ (Sym Eigendecomposition) Q’dAQ=dΛ+(Q’dQ)Λ- Λ(Q’dQ) (dA)^=(Q’dAQ)^= diagonal ^ strictly-upper diagonal = ∏dλ i =(dΛ)^ off-diag = ∏ ( (Q’dQ) ij (λ i -λ j ) ) ^=(Q’dQ)^ ∏|λ i -λ j | β

Haar Measure β=1: E Q (trace(AQBQ’) k )=∑C κ (A)C κ (B)/C κ (I) Forward Method: Suppose you know C κ ’s a-priori. (Jack Polynomials!) Let A and B be diagonal indeterminants (Think Generating Functions) Then can formally obtain moments of Q: Example: E(|q 11 | 2 |q 22 | 2 ) = (n+α-1)/(n(n-1)(n+α)) α:=2/ β Can Gram-Schmidt the ghosts. Same answers coming up!

Further Uses of Ghosts Multivariate Othogonal Polynomials Largest Eigenvalues/Smallest Eigenvalues Noncentral Distributions Expect Lots of Uses to be discovered…