Limit Laws for Random Matrices from Traffic Probability
|
|
- Buddy King
- 5 years ago
- Views:
Transcription
1 Limit Laws for Random Matrices from Traffic Probability arxiv: Slides available at math.berkeley.edu/ bensonau Benson Au UC Berkeley May 9th, 2016 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
2 Wigner s Semicircle Law Definition (Wigner matrix) Let (W i,j ) 1 i<j< and (W i,i ) 1 i< be independent families of i.i.d. real-valued random variables such that EW 1,2 = 0, Var(W 1,2 ) = 1, and Var(W 1,1 ) <. We call the random real symmetric n n matrix W n defined by { Wi,j / n if i < j W n (i, j) = W i,i / n if i = j a Wigner matrix. Theorem (Wigner, 1955) The empirical spectral distributions (ESDs) µ(w n ) converge weakly almost surely to the standard semicircle distribution SC(0, 1), where SC(m, σ 2 )(dx) = 1 2πσ 2 (4σ2 (x m) 2 ) 1/2 + dx. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
3 Wigner s Semicircle Law Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
4 Non-commutative Probability Consider first the case of a usual measurable space (Ω, F). For a given probability measure P on (Ω, F), we may form the (commutative) -algebra L (Ω, F, P) of measurable complex-valued functions having finite moments of all orders, i.e., L (Ω, F, P) = L p (Ω, F, P). The expectation E : L (Ω, F, P) C recovers the probability measure P; thus, the passage from the probability space (Ω, F, P) = ((Ω, F), P) to the pair (L (Ω, F, P), E) involves no loss of information. p=1 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
5 Non-commutative Probability Definition (Non-commutative probability space) A non-commutative probability space is a pair (A, ϕ) consisting of a unital algebra A over C equipped with a unital linear functional ϕ : A C. Examples (L (Ω, F, P), E) (M n (C), 1 n tr) (M n (L (Ω, F, P)), E 1 n tr) (C[G], τ G ) Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
6 Notions of Independence For a collection of random variables S A, we write S for the subset (possibly empty) of centered random variables in S. Definition (Classical independence) Subalgebras (A i ) i I are classically independent if the A i commute and ϕ is multiplicative across the A i in the following sense: for all k 1 and distinct indices i(1),..., i(k) I, ( k ) ϕ a i(j) = j=1 k ϕ(a i(j) ), a i(j) A i(j), (1) j=1 or, equivalently, ( k ) ϕ a i(j) j=1 = 0, a i(j) A i(j). (2) Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
7 Notions of Independence Voiculescu: What is free probability theory? It is not a euphemism for the advocacy of an unconstrained attitude in the practice of probability. It can rather be described by the exact formula free probability = non-commutative probability theory+free independence. Definition (Free independence) Subalgebras (A i ) i I are freely independent if for all k 1 and consecutively distinct indices i(1) i(2) i(k) I, ( k ) ϕ a i(j) j=1 = 0, a i(j) A i(j). (3) Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
8 Non-commutative Central Limit Theorems (CLTs) Theorem (de Moivre, 1733; Voiculescu, 1985) Let (a n ) be a sequence of identically distributed self-adjoint random variables in a -probability space (A, ϕ). Assume that the a n are centered with unit variance, i.e., ϕ(a n ) = 0 with ϕ(an) 2 = 1, and write s n = 1 n n j=1 a j. We consider two cases. (i) If the a n are classically independent, then (s n ) converges in distribution to a standard normal random variable, i.e., lim n ϕ(sm n ) = t m 1 e t2 /2 dt, m N. 2π R (ii) If the a n are freely independent, then (s n ) converges in distribution to a standard semicircular random variable, i.e., 2 lim n ϕ(sm n ) = t m 1 4 t 2 2π 2 dt, m N. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
9 Limit Laws for Random Matrices from Free Probability Theorem (Voiculescu, 1991; Dykema, 1993) With the appropriate moment assumptions, independent Wigner matrices are asymptotically freely independent. Corollary The ESDs µ(w n ) converge in expectation to the standard semicircle distribution SC(0, 1). Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
10 Random Markov Matrices Definition (Markov matrix) Let W n be a Wigner matrix, and let D n be the diagonal matrix of row sums of W n, i.e., D n (i, i) = n W n (i, j) = j=1 n W i,j / n. We call the random real symmetric n n matrix M n defined by j=1 a Markov matrix. M n = W n D n Theorem (Bryc, Dembo, and Jiang, 2006) The ESDs µ(m n ) converge weakly almost surely to the free convolution N (0, 1) SC(0, 1). Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
11 n W 1,j W 1,2 W 1,3 W 1,n j 1 n W 2,1 W 2,j W 2,3 W 2,n j 2. M n = 1 W 3,1 W.. 3,2. n.. n W k,1 W k,2 W k,j W k,n j k n W n,1 W n,2 j n W n,j Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
12 Generalized Notions of Independence Do there exist other notions of independence in the non-commutative probabilistic setting? Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
13 Generalized Notions of Independence Do there exist other notions of independence in the non-commutative probabilistic setting? Theorem (Speicher, 1997) No. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
14 -graph polynomials We write x = (x i ) i I for a set of indeterminates. We implicitly assume an associated set of indeterminates x = (x i ) i I such that (x, x ) = (x i, x i ) i I gives a set of pairwise distinct indeterminates satisfying the natural -relation. Definition ( -graph monomial) A -graph monomial in the indeterminates x is a finite, connected, bi-rooted -graph in x. We denote the set of -graph monomials in x by G x, x. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
15 -graph polynomials Example in x 2 x 1 x x3 x1 2 x 1 out Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
16 -graph polynomials Definition ( -graph polynomials) We write CG x, x for the complex vector space of finite linear combinations in G x, x, the elements of which we call the -graph polynomials. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
17 -graph polynomials Example = Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
18 -graph polynomials Example = Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
19 -graph polynomials Example ( x 1 ) x2 = x 3 x 1 x 2 x 3 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
20 -graph polynomials Example ( x 1 ) x2 = x 3 x 3 x 2 x 1 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
21 Traffic Probability Definition (Traffic space) A traffic space is a tracial -probability space (A, ϕ) such that A is an algebra over the symmetric operad of -graph polynomials. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
22 Traffic Probability Definition (Traffic space) A traffic space is a tracial -probability space (A, ϕ) such that A is an algebra over the symmetric operad of -graph polynomials. with the additional structure to evaluate -graph polynomials in the random variables a A. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
23 Traffic Probability Definition (Traffic space) A traffic space is a tracial -probability space (A, ϕ) such that A is an algebra over the symmetric operad of -graph polynomials. with the additional structure to evaluate -graph polynomials in the random variables a A. Example Let A = (A i ) i I be a family of random n n matrices. For a -graph monomial t = (T, v in, v out ) = (V, E, f, g, γ, ε, v in, v out ) in x = (x i ) i I, we define t(a) to be the random n n matrix with entries t(a)(i, j) = φ:v [n] φ(v in )=i, φ(v out)=j e E A ε(e) γ(e) (φ(f (e)), φ(g(e))) Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
24 Traffic Probability Example (A 1, A 2 ) x 1 x 2 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
25 Traffic Probability Example (A 1, A 2 ) x 1 x 2 = A 1 A 2 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
26 Traffic Probability Example x 1 (A 1, A 2 ) x 2 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
27 Traffic Probability Example x 1 ) (A 1, A 2 = A 1 A 2 x 2 Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
28 Traffic Probability Example x (A) = row(a) Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
29 CLTs Revisited Theorem (de Moivre, 1733; Voiculescu, 1985) Let (a n ) be a sequence of identically distributed self-adjoint random variables in a -probability space (A, ϕ). Assume that the a n are centered with unit variance, i.e., ϕ(a n ) = 0 with ϕ(an) 2 = 1, and write s n = 1 n n j=1 a j. We consider two cases. (i) If the a n are classically independent, then (s n ) converges in distribution to a standard normal random variable, i.e., lim n ϕ(sm n ) = t m 1 e t2 /2 dt, m N. 2π R (ii) If the a n are freely independent, then (s n ) converges in distribution to a standard semicircular random variable, i.e., 2 lim n ϕ(sm n ) = t m 1 4 t 2 2π 2 dt, m N. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
30 CLTs Revisited Theorem (Male, 2012) (iii) Assume that A has the additional structure of a traffic space (A, ϕ, τ). We split the variance of a n as 1 = ϕ(a 2 n) = τ [ T 1 (a n ) ] = τ 0[ T 1 (a n ) ] + τ 0[ T 2 (a n ) ] = α + (1 α), where x x T 1 = and T 2 =. x x If the a n are traffic independent, then (s n ) converges in distribution to the free convolution µ α = SC(0, α) N (0, 1 α), i.e., lim n ϕ(sm n ) = t m µ α (dt), m N. R Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
31 Limit Laws for Random Matrices from Traffic Probability Definition ((p, q)-markov matrices) Let W n be a Wigner matrix and D n = row(w n ) the diagonal matrix of row sums of W n. For p, q R, we call the real symmetric n n matrix M n,p,q defined by M n,p,q = pw n + qd n a (p, q)-markov matrix. Theorem (Au, 2016) Let (W n (l) : 1 l < ) be a sequence of independent finite moments Wigner matrices. Then the families ((M (l) n,p,q) p,q R : 1 l < ) are asymptotically traffic independent with stable universal limiting traffic distribution. Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
32 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
33 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). 100 p = 1, q = Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
34 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). 100 p =.8, q = ± Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
35 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). 150 p =.6, q = ± Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
36 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). 150 p =.4, q = ± Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
37 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). 200 p =.2, q = ± Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
38 Limit Laws for Random Matrices from Traffic Probability Corollary The ESDs µ(m n,p,q ) converge in expectation to the free convolution SC(0, p 2 ) N (0, q 2 ). 250 p = 0, q = Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
39 Limit Laws for Random Matrices from Traffic Probability Theorem (Au, 2016) Let W n be a Wigner matrix, and let (X n ) and (Y n ) be sequences of real-valued random variables converging almost surely to X and Y respectively. Then the ESDs µ(m n,xn,y n ) converge weakly almost surely to the random free convolution SC(0, X 2 ) N (0, Y 2 ). Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
40 Limit Laws for Random Matrices from Traffic Probability Theorem (Au, 2016) Let W n be a Wigner matrix, and let (X n ) and (Y n ) be sequences of real-valued random variables converging almost surely to X and Y respectively. Then the ESDs µ(m n,xn,y n ) converge weakly almost surely to the random free convolution SC(0, X 2 ) N (0, Y 2 ). Thank you! Benson Au (UC Berkeley) Random Matrices from Traffic Probability May 9th, / 27
PATTERNED RANDOM MATRICES
PATTERNED RANDOM MATRICES ARUP BOSE Indian Statistical Institute Kolkata November 15, 2011 Introduction Patterned random matrices. Limiting spectral distribution. Extensions (joint convergence, free limit,
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 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 informationOperator-Valued Free Probability Theory and Block Random Matrices. Roland Speicher Queen s University Kingston
Operator-Valued Free Probability Theory and Block Random Matrices Roland Speicher Queen s University Kingston I. Operator-valued semicircular elements and block random matrices II. General operator-valued
More informationFree Probability Theory and Non-crossing Partitions. Roland Speicher Queen s University Kingston, Canada
Free Probability Theory and Non-crossing Partitions Roland Speicher Queen s University Kingston, Canada Freeness Definition [Voiculescu 1985]: Let (A, ϕ) be a non-commutative probability space, i.e. A
More informationThe norm of polynomials in large random matrices
The norm of polynomials in large random matrices Camille Mâle, École Normale Supérieure de Lyon, Ph.D. Student under the direction of Alice Guionnet. with a significant contribution by Dimitri Shlyakhtenko.
More informationOperator norm convergence for sequence of matrices and application to QIT
Operator norm convergence for sequence of matrices and application to QIT Benoît Collins University of Ottawa & AIMR, Tohoku University Cambridge, INI, October 15, 2013 Overview Overview Plan: 1. Norm
More informationCOMPUTING MOMENTS OF FREE ADDITIVE CONVOLUTION OF MEASURES
COMPUTING MOMENTS OF FREE ADDITIVE CONVOLUTION OF MEASURES W LODZIMIERZ BRYC Abstract. This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants
More informationFree probability and quantum information
Free probability and quantum information Benoît Collins WPI-AIMR, Tohoku University & University of Ottawa Tokyo, Nov 8, 2013 Overview Overview Plan: 1. Quantum Information theory: the additivity problem
More informationSecond Order Freeness and Random Orthogonal Matrices
Second Order Freeness and Random Orthogonal Matrices Jamie Mingo (Queen s University) (joint work with Mihai Popa and Emily Redelmeier) AMS San Diego Meeting, January 11, 2013 1 / 15 Random Matrices X
More informationFREE PROBABILITY THEORY AND RANDOM MATRICES
FREE PROBABILITY THEORY AND RANDOM MATRICES ROLAND SPEICHER Abstract. Free probability theory originated in the context of operator algebras, however, one of the main features of that theory is its connection
More informationFree Entropy for Free Gibbs Laws Given by Convex Potentials
Free Entropy for Free Gibbs Laws Given by Convex Potentials David A. Jekel University of California, Los Angeles Young Mathematicians in C -algebras, August 2018 David A. Jekel (UCLA) Free Entropy YMC
More informationFREE PROBABILITY THEORY
FREE PROBABILITY THEORY ROLAND SPEICHER Lecture 4 Applications of Freeness to Operator Algebras Now we want to see what kind of information the idea can yield that free group factors can be realized by
More informationSelfadjoint Polynomials in Independent Random Matrices. Roland Speicher Universität des Saarlandes Saarbrücken
Selfadjoint Polynomials in Independent Random Matrices Roland Speicher Universität des Saarlandes Saarbrücken We are interested in the limiting eigenvalue distribution of an N N random matrix for N. Typical
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 informationLecture III: Applications of Voiculescu s random matrix model to operator algebras
Lecture III: Applications of Voiculescu s random matrix model to operator algebras Steen Thorbjørnsen, University of Aarhus Voiculescu s Random Matrix Model Theorem [Voiculescu]. For each n in N, let X
More informationAnalytic versus Combinatorial in Free Probability
Analytic versus Combinatorial in Free Probability James Mingo (Queen s University), Alexandru Nica (UWaterloo), Roland Speicher (Saarland University), Dan-Virgil Voiculescu (UC Berkeley) Dec 4-9, 2016
More informationMatricial R-circular Systems and Random Matrices
Instytut Matematyki i Informatyki Politechnika Wrocławska UC Berkeley, March 2014 Motivations Motivations: describe asymptotic distributions of random blocks construct new random matrix models unify concepts
More informationA new method to bound rate of convergence
A new method to bound rate of convergence Arup Bose Indian Statistical Institute, Kolkata, abose@isical.ac.in Sourav Chatterjee University of California, Berkeley Empirical Spectral Distribution Distribution
More informationFree Probability Theory and Random Matrices
Free Probability Theory and Random Matrices R. Speicher Department of Mathematics and Statistics Queen s University, Kingston ON K7L 3N6, Canada speicher@mast.queensu.ca Summary. Free probability theory
More informationDISTRIBUTION 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 informationMatrix-valued stochastic processes
Matrix-valued stochastic processes and applications Małgorzata Snarska (Cracow University of Economics) Grodek, February 2017 M. Snarska (UEK) Matrix Diffusion Grodek, February 2017 1 / 18 Outline 1 Introduction
More informationRandom Matrix Theory Lecture 3 Free Probability Theory. Symeon Chatzinotas March 4, 2013 Luxembourg
Random Matrix Theory Lecture 3 Free Probability Theory Symeon Chatzinotas March 4, 2013 Luxembourg Outline 1. Free Probability Theory 1. Definitions 2. Asymptotically free matrices 3. R-transform 4. Additive
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 We are interested in the limiting eigenvalue distribution of N N random matrices for N. Usually, large N
More informationFree Probability Theory
Noname manuscript No. (will be inserted by the editor) Free Probability Theory and its avatars in representation theory, random matrices, and operator algebras; also featuring: non-commutative distributions
More informationLyapunov exponents of free operators
Journal of Functional Analysis 255 (28) 1874 1888 www.elsevier.com/locate/jfa Lyapunov exponents of free operators Vladislav Kargin Department of Mathematics, Stanford University, Stanford, CA 9435, USA
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 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 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 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 informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
More informationTwo-parameter Noncommutative Central Limit Theorem
Two-parameter Noncommutative Central Limit Theorem Natasha Blitvić Vanderbilt University January 11, 2013 N. Blit. 11/1/2013 1 / 39 (Classical) Central Limit Theorem CLT (Classical) Probability space:
More informationILWOO CHO. In this paper, we will reformulate the moments and cumulants of the so-called generating operator T 0 = N
GRAPH W -PROBABILITY ON THE FREE GROUP FACTOR L(F N arxiv:math/0507094v1 [math.oa] 5 Jul 005 ILWOO CHO Abstract. In this paper, we will consider the free probability on the free group factor L(F N, in
More informationSEA s workshop- MIT - July 10-14
Matrix-valued Stochastic Processes- Eigenvalues Processes and Free Probability SEA s workshop- MIT - July 10-14 July 13, 2006 Outline Matrix-valued stochastic processes. 1- definition and examples. 2-
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 informationThe Hadamard product and the free convolutions
isid/ms/205/20 November 2, 205 http://www.isid.ac.in/ statmath/index.php?module=preprint The Hadamard product and the free convolutions Arijit Chakrabarty Indian Statistical Institute, Delhi Centre 7,
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationCharacterizations of free Meixner distributions
Characterizations of free Meixner distributions Texas A&M University March 26, 2010 Jacobi parameters. Matrix. β 0 γ 0 0 0... 1 β 1 γ 1 0.. m n J =. 0 1 β 2 γ.. 2 ; J n =. 0 0 1 β.. 3............... A
More informationJeffrey H. Schenker and Hermann Schulz-Baldes
Mathematical Research Letters 12, 531 542 (2005) SEMICIRCLE LAW AND FREENESS FOR RANDOM MATRICES WITH SYMMETRIES OR CORRELATIONS Jeffrey H. Schenker and Hermann Schulz-Baldes Abstract. For a class of random
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 informationQuantum symmetries in free probability. Stephen Robert Curran
Quantum symmetries in free probability by Stephen Robert Curran A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate
More informationFree Probability and Random Matrices: from isomorphisms to universality
Free Probability and Random Matrices: from isomorphisms to universality Alice Guionnet MIT TexAMP, November 21, 2014 Joint works with F. Bekerman, Y. Dabrowski, A.Figalli, E. Maurel-Segala, J. Novak, D.
More informationMatrix Multiplication
3.2 Matrix Algebra Matrix Multiplication Example Foxboro Stadium has three main concession stands, located behind the south, north and west stands. The top-selling items are peanuts, hot dogs and soda.
More informationIsotropic local laws for random matrices
Isotropic local laws for random matrices Antti Knowles University of Geneva With Y. He and R. Rosenthal Random matrices Let H C N N be a large Hermitian random matrix, normalized so that H. Some motivations:
More informationQuantum Symmetric States
Quantum Symmetric States Ken Dykema Department of Mathematics Texas A&M University College Station, TX, USA. Free Probability and the Large N limit IV, Berkeley, March 2014 [DK] K. Dykema, C. Köstler,
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 informationSpectral Continuity Properties of Graph Laplacians
Spectral Continuity Properties of Graph Laplacians David Jekel May 24, 2017 Overview Spectral invariants of the graph Laplacian depend continuously on the graph. We consider triples (G, x, T ), where G
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 informationAlgebraic reformulation of Connes embedding problem and the free group algebra.
Algebraic reformulation of Connes embedding problem and the free group algebra. Kate Juschenko, Stanislav Popovych Abstract We give a modification of I. Klep and M. Schweighofer algebraic reformulation
More informationQuantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
Quantum Probability and Asymptotic Spectral Analysis of Growing Graphs Nobuaki Obata GSIS, Tohoku University Roma, November 14, 2013 Quantum Probability and Asymptotic Spectral Analysis of Growing Roma,
More informationA simple proof for monotone CLT
A simple proof for monotone CLT Hayato Saigo Graduate School of Science, Kyoto University, Kyoto 606-8502, Japan arxiv:0912.3728v1 [math.pr] 18 Dec 2009 Abstract In the case of monotone independence, the
More informationASYMPTOTIC EIGENVALUE DISTRIBUTIONS OF BLOCK-TRANSPOSED WISHART MATRICES
ASYMPTOTIC EIGENVALUE DISTRIBUTIONS OF BLOCK-TRANSPOSED WISHART MATRICES TEODOR BANICA AND ION NECHITA Abstract. We study the partial transposition W Γ = (id t)w M dn (C) of a Wishart matrix W M dn (C)
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 informationRECTANGULAR RANDOM MATRICES, ENTROPY, AND FISHER S INFORMATION
J. OPERATOR THEORY 00:0(XXXX), 00 00 Copyright by THETA, XXXX RECTANGULAR RANDOM MATRICES, ENTROPY, AND FISHER S INFORMATION FLORENT BENAYCH-GEORGES Communicated by Serban Stratila ABSTRACT. We prove that
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 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 informationThe Hilbert Space of Random Variables
The Hilbert Space of Random Variables Electrical Engineering 126 (UC Berkeley) Spring 2018 1 Outline Fix a probability space and consider the set H := {X : X is a real-valued random variable with E[X 2
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationThe Distribution of the Minimum of Independent Phase Type Random Variables
The Distribution of the Minimum of Independent Phase Type Random Variables Darcy Bermingham, supervised by Yoni Nazarathy The University of Queensland School of Mathematics and Physics December 215 In
More informationSupelec Randomness in Wireless Networks: how to deal with it?
Supelec Randomness in Wireless Networks: how to deal with it? Mérouane Debbah Alcatel-Lucent Chair on Flexible Radio merouane.debbah@supelec.fr The performance dilemma... La théorie, c est quand on sait
More informationEigenvalues and Singular Values of Random Matrices: A Tutorial Introduction
Random Matrix Theory and its applications to Statistics and Wireless Communications Eigenvalues and Singular Values of Random Matrices: A Tutorial Introduction Sergio Verdú Princeton University National
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
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 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 informationEQ: What are limits, and how do we find them? Finite limits as x ± Horizontal Asymptote. Example Horizontal Asymptote
Finite limits as x ± The symbol for infinity ( ) does not represent a real number. We use to describe the behavior of a function when the values in its domain or range outgrow all finite bounds. For example,
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 informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More informationCLASSICAL AND FREE FOURTH MOMENT THEOREMS: UNIVERSALITY AND THRESHOLDS. I. Nourdin, G. Peccati, G. Poly, R. Simone
CLASSICAL AND FREE FOURTH MOMENT THEOREMS: UNIVERSALITY AND THRESHOLDS I. Nourdin, G. Peccati, G. Poly, R. Simone Abstract. Let X be a centered random variable with unit variance, zero third moment, and
More informationCombinatorial Aspects of Free Probability and Free Stochastic Calculus
Combinatorial Aspects of Free Probability and Free Stochastic Calculus Roland Speicher Saarland University Saarbrücken, Germany supported by ERC Advanced Grant Non-Commutative Distributions in Free Probability
More informationSome appications of free stochastic calculus to II 1 factors.
Some appications of free stochastic calculus to II 1 factors. Dima Shlyakhtenko UCLA Free Entropy Dimension (Voiculescu) G = S nitely generated discrete group, τ G : CF S C. ω Mn n = M 1 k=1 k k/{(x k
More informationLecture 7. Econ August 18
Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar
More informationFree Probability Theory and Random Matrices
Free Probability Theory and Random Matrices Roland Speicher Motivation of Freeness via Random Matrices In this chapter we want to motivate the definition of freeness on the basis of random matrices.. Asymptotic
More informationarxiv:math/ v3 [math.oa] 16 Oct 2005
arxiv:math/0405191v3 [math.oa] 16 Oct 2005 SECOD ORDER FREEESS AD FLUCTUATIOS OF RADOM MATRICES: I. GAUSSIA AD WISHART MATRICES AD CYCLIC FOCK SPACES JAMES A. MIGO ( ) AD ROLAD SPEICHER ( )( ) Abstract.
More informationBrown University Analysis Seminar
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,
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 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 informationSTAT C206A / MATH C223A : Stein s method and applications 1. Lecture 31
STAT C26A / MATH C223A : Stein s method and applications Lecture 3 Lecture date: Nov. 7, 27 Scribe: Anand Sarwate Gaussian concentration recap If W, T ) is a pair of random variables such that for all
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 informationFréchet differentiability of the norm of L p -spaces associated with arbitrary von Neumann algebras
Fréchet differentiability of the norm of L p -spaces associated with arbitrary von Neumann algebras (Part I) Fedor Sukochev (joint work with D. Potapov, A. Tomskova and D. Zanin) University of NSW, AUSTRALIA
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationCompound matrices and some classical inequalities
Compound matrices and some classical inequalities Tin-Yau Tam Mathematics & Statistics Auburn University Dec. 3, 04 We discuss some elegant proofs of several classical inequalities of matrices by using
More informationQuantum Symmetries in Free Probability Theory. Roland Speicher Queen s University Kingston, Canada
Quantum Symmetries in Free Probability Theory Roland Speicher Queen s University Kingston, Canada Quantum Groups are generalizations of groups G (actually, of C(G)) are supposed to describe non-classical
More informationarxiv: v1 [math.nt] 16 Jan 2018
ROOTED TREE MAPS AND THE KAWASHIMA RELATIONS FOR MULTIPLE ZETA VALUES HENRIK BACHMANN AND TATSUSHI TANAKA arxiv:1801.05381v1 [math.nt] 16 Jan 2018 Abstract. Recently, inspired by the Connes-Kreimer Hopf
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 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 informationThe Adjoint of a Linear Operator
The Adjoint of a Linear Operator Michael Freeze MAT 531: Linear Algebra UNC Wilmington Spring 2015 1 / 18 Adjoint Operator Let L : V V be a linear operator on an inner product space V. Definition The adjoint
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationarxiv:math/ v1 [math.oa] 4 Apr 2005
NOTES ON FREE PROBABILITY THEORY arxiv:math/0504063v1 [math.oa] 4 Apr 2005 DIMITRI SHLYAKHTENKO. These notes are from a 4-lecture mini-course taught by the author at the conference on von Neumann algebras
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationAssessing the dependence of high-dimensional time series via sample autocovariances and correlations
Assessing the dependence of high-dimensional time series via sample autocovariances and correlations Johannes Heiny University of Aarhus Joint work with Thomas Mikosch (Copenhagen), Richard Davis (Columbia),
More informationOn Operator-Valued Bi-Free Distributions
On Operator-Valued Bi-Free Distributions Paul Skoufranis TAMU March 22, 2016 Paul Skoufranis On Operator-Valued Bi-Free Distributions March 22, 2016 1 / 30 Bi-Free with Amalgamation Let B be a unital algebra.
More informationPreface to the Second Edition...vii Preface to the First Edition... ix
Contents Preface to the Second Edition...vii Preface to the First Edition........... ix 1 Introduction.............................................. 1 1.1 Large Dimensional Data Analysis.........................
More informationFall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop
Fall 2017 Inverse of a matrix Authors: Alexander Knop Institute: UC San Diego Row-Column Rule If the product AB is defined, then the entry in row i and column j of AB is the sum of the products of corresponding
More informationFluctuations of Random Matrices and Second Order Freeness
Fluctuations of Random Matrices and Second Order Freeness james mingo with b. collins p. śniady r. speicher SEA 06 Workshop Massachusetts Institute of Technology July 9-14, 2006 1 0.4 0.2 0-2 -1 0 1 2-2
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 informationMixed q-gaussian algebras and free transport
Mixed q-gaussian algebras and free transport Qiang Zeng (Northwestern University) Joint with Marius Junge (Urbana) and Brent Nelson (Berkeley) Free probability and large N limit, V Berkeley, March 2016
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 informationLinear Algebra Review (Course Notes for Math 308H - Spring 2016)
Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Dr. Michael S. Pilant February 12, 2016 1 Background: We begin with one of the most fundamental notions in R 2, distance. Letting (x 1,
More informationReproducing Kernel Hilbert Spaces
Reproducing Kernel Hilbert Spaces Lorenzo Rosasco 9.520 Class 03 February 9, 2011 About this class Goal To introduce a particularly useful family of hypothesis spaces called Reproducing Kernel Hilbert
More information