Inhomogeneous circular laws for random matrices with non-identically distributed entries
|
|
- Barbra Hart
- 5 years ago
- Views:
Transcription
1 Inhomogeneous circular laws for random matrices with non-identically distributed entries Nick Cook with Walid Hachem (Telecom ParisTech), Jamal Najim (Paris-Est) and David Renfrew (SUNY Binghamton/IST Austria) UC Davis, 2017/04/19
2 The Circular Law Empirical spectral distribution (ESD) for M M n (C) with eigenvalues λ 1,..., λ n C: µ M = 1 n δ λi. iid matrix model: Atom variable: ξ C with E ξ = 0, E ξ 2 = 1. For n 1 let X n be n n with iid entries ξ (n) d = ξ. Theorem (Mehta 67, Girko 84, Edelman 97, Bai 97, Götze Tikhomirov 05, 07, Pan Zhou 07, Tao Vu 07, Tao Vu 08) Almost surely, µ 1 n X n converges weakly to 1 π 1 B(0,1)dxdy as n. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 2 / 24
3 Applications: stability for mean field models of dynamical systems Model a neural network with a nonlinear system of ODEs: ẋ i (t) = x i (t) + Y tanh(x j (t)) where x i is the membrane potential for the ith neuron and tanh(x i ) is its firing rate. Sompolinsky, Crisanti, Sommers 88: modeled the synaptic matrix Y with a random matrix. (Similar to approach by [May 72] in ecology.) More recent work [Rajan, Abbott 06], [Tao 09], [Aljadeff, Renfrew, Stern 14] has tried to incorporate other structural features of neural networks into the distribution of Y. Desirable to consider Y with a general, possibly sparse variance profile, i.e. Y n = 1 ( 1 A n X n = n σ ξ ). n j=1 N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 3 / 24
4 Simulated ESDs for Y n = ( 1 n σ ξ ) n = 2000 ξ {± 1 2 ± i 1 2 } uniform. σ = σ( i n, j n ), with σ(x, y) = 1( x y 0.05) Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 4 / 24
5 ( ) Simulated ESDs for Y n = n 1 σ ξ n = 2000 ξ {± 1 2 ± i 1 2 } uniform. σ = σ( i n, j n ), with σ(x, y) = (x + y) 2 1( x y 0.1) Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 5 / 24
6 ( ) Simulated ESDs for Y n = n 1 σ ξ n = 2001 ξ {± 1 2 ± i 1 2 } uniform. 0 1 n/3 1 n/3 A n = (σ ) = 1 n/ n/ Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 6 / 24
7 The model and assumptions Inputs: Y n = 1 ( 1 A n X n = n n σ (n) ) ξ (n). Atom variable ξ C with E ξ = 0, E ξ 2 = 1, E ξ 4+ε <. X n = (ξ (n) ) sequence of iid matrices with atom variable ξ. Standard deviation profiles A n = (σ (n) ) with uniformly bounded entries, i.e. σ (n) [0, 1]. Additionally assume A n is robustly irreducible for all n. Assumptions allow for vanishing variances (σ (n) = 0 for (say) 99% of entries). N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 7 / 24
8 Results Y n = 1 n A n X n = ( 1 n σ (n) ξ (n) E ξ 4+ε <, σ (n) [0, 1], A n robustly irreducible. ), with Theorem (C., Hachem, Najim, Renfrew 16) (Abridged) In the above setup, for each n, A n determines a deterministic, compactly supported, rotationally invariant probability measure µ n over C such that µ Yn µ n in probability, i.e. f dµ Yn f dµ n 0 in probability f C b (C). C C Refer to measures µ n as deterministic equivalents for µ Yn. Recent work of Alt, Erdős and Krüger gives a local version under stronger hypotheses (ξ having bounded density and all moments, σ (n) σ min > 0). N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 8 / 24
9 Results Y n = 1 n A n X n = ( 1 E ξ 4+ε <, n σ (n) ξ (n) ), with σ (n) uniformly bounded, A n robustly irreducible. V n = ( 1 n σ2 ) doubly stochastic. Theorem (Circular law for doubly stochastic variance profile) With Y n as above, µ Yn 1 π 1 B(0,1)dxdy in probability. Analogue of a result of Anderson and Zeitouni 06 for Hermitian random matrices. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 9 / 24
10 How does A n determine µ n? Through the Master Equations For s > 0 consider the following system in unknowns q, q R n : ME(s) : q i = q i = (V T n q) i s 2 + (V n q) i (V T n q) i, (V n q) i s 2 + (V n q) i (V T n q) i, q i = Can show that if V n is irreducible, s (0, ρ(v n )), unique non-trivial solution (q(s), q(s)) R 2n 0. µ n is the radially symmetric probability measure on C with µ n (B(0, s)) = 1 1 n q(s)t V n q(s) s (0, ) where we set q(s) = q(s) = 0 for s ρ(v n ). q i. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 10 / 24
11 Plot of F n (s) = 1 1 n q(s)t V n q(s) (curve) vs empirical realization (+) n = 2001 ξ {± 1 2 ± i 1 2 } uniform. 0 1 n/3 1 n/3 A n = (σ ) = 1 n/ n/ Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 11 / 24
12 Useful transforms for proving convergence of measures For sums of independent scalar r.v. s use the Fourier transform (characteristic function). For µ supported on R (such as ESDs of Hermitian matrices) we have the Stieltjes transform s µ : C + C +, s µ (w) = R dµ(x) x w, µ = lim 1 t 0 π Im s µ( + it) = lim µ Cauchy(t). t 0 For µ supported on C (such as ESDs of non-hermitian matrices) we have the log transform (or Coulomb potential) U µ (z) = log λ z dµ(λ), µ = 1 2π U µ. C N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 12 / 24
13 Girko s Hermitization approach log transform for probability measure µ on C: U µ (z) = log λ z µ(dλ), µ = 1 2π U µ. For the ESD of Y n = 1 n A n X n, C U µyn (z) = 1 log λ i (Y n ) z = 1 n n log det(y n z) = 1 2n log det(y n z ) = log x dµ Y z n (x) R ( ) where Yn z 0 Y n z := is a 2n 2n Hermitian matrix with Yn z 0 eigenvalues {±s i (Y n z)} n R.. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 13 / 24
14 Girko s Hermitization approach Y z n = 0 Y n z Y n z 0, U µyn (z) = log x dµ Y z n (x). R Two steps. For a.e. z C: 1 Find deterministic equivalents ν z n µ Y z n. 2 Prove these measures uniformly (in n) integrate log. Now we can use the Stieltjes transform sn(w) z := R dµ Y z n (x) x w = 1 2n 2 where R z n (w) := (Y z n w) 1 is the resolvent of Y z n. 1 λ i (Yn z ) w = 1 2n Tr Rz n (w) N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 14 / 24
15 Deterministic equivalents for resolvents R z n (w): Complex Gaussian case I 2n = Rn z (w) 1 Rn z (w) = w Yn z Y n z S w T T = ws z T + Y T S 1 = w E S ii z E T ii + (Gaussian IBP) = w E S ii z E T ii + (Resolvent derivative formula) (Cauchy Schwarz & Poincaré) = w E S ii z E T ii 1 n E Y Tji j=1 j=1 1 n σ2 E Y T ji σe 2 S ii Sjj j=1 w E S ii z E T ii 1 n (E S ii) σ(e 2 S jj ). j=1 N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 15 / 24
16 Deterministic equivalents for resolvents Rn z (w) = (Yn z w) 1 = ( S T) T S Similarly obtain equations for E S ii, E S ii, E T ii, E T ii, 1 i n from diagonal entries of the other three blocks. Eventually reduce to a perturbed cubic system of 2n equations: E S ii = E S ii = (Vn T s) i + w z 2 [(Vn T s) i + w][(v n s) i + w] + E n, (V n s) i + w z 2 [(Vn T s) i + w][(v n s) i + w] + E n, where s := (E S ii ) n, s := (E S ii ) n, and E n, E n are small errors. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 16 / 24
17 Deterministic equivalents for resolvents Rn z (w) = (Yn z w) 1 = ( S T) T S Stability analysis s, s are close to solutions p( z, w), p( z, w) of the unperturbed system (the Schwinger Dyson loop equations): (Vn T p) i + w p i = z 2 [(Vn T p) i + w][(v n p) i + w], LE( z, w) : (V n p) i + w p i = z 2 [(Vn T p) i + w][(v n p) i + w]. In particular: E sn(w) z = E 1 2n Tr Rz n (w) = E 1 2n 1 2n ( S ii + ( p i + ) S ii ) p i = 1 n p i. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 17 / 24
18 Deterministic equivalents for resolvents Rn z (w) = (Yn z w) 1 = ( S T) T S E s z n(w) 1 n p i. Extend to the non-gaussian case by a Lindeberg swapping argument, and remove the expectation with concentration of measure. Get s z n(w) 1 n p i a.s. in the general case (and we can quantify the error). RHS is the Stieltjes transform of a probability measure ν z n on R, so µ Y z n ν z n a.s. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 18 / 24
19 Integrability of log We obtained deterministic equivalents ν z n for the Hermitized ESDs µ Y z n. Remains to show for a.e. z C, µ Y z n and νn z uniformly integrate log, i.e. ε > 0 T > 0 : log x dµ Y z n (x) ε log x T with probability 1 ε, and similarly for ν z n. Singularity of log at is easy to handle. Two-step approach to singularity at 0: 1 (Wegner estimate) Use bounds on the Stieltjes transform to show µ Y z n ([ t, t]) = O(t) for t n c. 2 (Invertibility) Prove λ min (Y z n ) = s min (Y n z) n C w.h.p. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 19 / 24
20 Integrability of log: Wegner estimates Stieltjes transform controls the density of eigenvalues in short intervals: 1 t µ Yn z ([ t, t]) µ Yn z Cauchy(t) = Im sz n(it). From the loop equations: Im sn(it) z 1 Im p i ( z, it). n Key Proposition Let z 0, t > 0, and let p( z, it), p( z, it) be solutions to LE( z, it). If A n is robustly irreducible, then 1 n Im p i ( z, it) K for some constant K < independent of n, t. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 20 / 24
21 Integrability of log Invertibility of structured random matrices Want to show s min (Y n z) n C with high probability (w.h.p.). Recall s min (M) = 0 iff M is singular, and otherwise s min (M) = 1/ M 1. Say a random matrix M is well-invertible w.h.p. if { P M 1 n α} = O(n β ) for some constants α, β > 0. Question: For what choices of n n matrices A = (a ), B = (b ) is Y = 1 ( 1 ) A X + B = n a ξ + b n well-invertible w.h.p.? (For convergence of ESDs we are interested in the shifts B = zi n.) N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 21 / 24
22 Invertibility of 1 n A X + B = ( 1 n a ξ + b ) Condition number X X 1 for iid matrices is well-studied (von Neumann et al. 40s, Edelman 88, Sankar Spielman Teng 06, Tao Vu 05, 07, Rudelson 05, Rudelson Vershynin 07). Norm: X = O( n) w.h.p. (folklore / Bai Yin) Norm of the inverse: { P X 1 n α(β)} n β Tao Vu 05, 07 { P X 1 } n/ε ε + e cn Rudelson Vershynin 07 (ξ sub-gaussian). So X X 1 = n O(1) w.h.p. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 22 / 24
23 Invertibility of 1 n A X + B = ( 1 n a ξ + b ) Structured matrices: 1 n A X + B is well-invertible w.h.p. when a σ 0 > 0, B n O(1) Bordenave Chafaï 11 A is broadly connected, B = O(1) Rudelson Zeitouni 12 for ξ N R (0, 1), C. 16 general case. The above give bounds that are uniform in the shift B, i.e. { ( } 1 1 sup P n A X + B) B: B n nα = O(n β ). O(1) Can we further relax hypotheses on A if B is well-invertible (such as B = zi n for fixed z 0)? N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 23 / 24
24 Well-invertibility under diagonal perturbation Theorem (C. 16) Let Y = 1 n A X + Z, where 1 X = (ξ ) iid matrix with E ξ = 0, E ξ 2 = 1, E ξ 4+ε = γ < ; 2 A [0, 1] n n arbitrary; 3 Z = diag(z i ) n, z i [r, R] (0, + ) for all i [n]. There exist α, β > 0, C < depending only on ε, γ, r, R such that P ( Y 1 n α) Cn β. Note: Proof gives α = twr[o ε (1) exp((γ/r) O(1) )]. The tower exponential is due to use of Szemerédi s regularity lemma. Conjecture Above holds if Z is any matrix with s i (Z) [r, R] for all i [n]. N. Cook, W. Hachem, J. Najim, D. Renfrew (Stanford) UC Davis, 2017/04/19 24 / 24
Random regular digraphs: singularity and spectrum
Random regular digraphs: singularity and spectrum Nick Cook, UCLA Probability Seminar, Stanford University November 2, 2015 Universality Circular law Singularity probability Talk outline 1 Universality
More 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 informationSmall Ball Probability, Arithmetic Structure and Random Matrices
Small Ball Probability, Arithmetic Structure and Random Matrices Roman Vershynin University of California, Davis April 23, 2008 Distance Problems How far is a random vector X from a given subspace H in
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 informationLOWER BOUNDS FOR THE SMALLEST SINGULAR VALUE OF STRUCTURED RANDOM MATRICES. By Nicholas Cook University of California, Los Angeles
Submitted to the Annals of Probability arxiv: arxiv:1608.07347 LOWER BOUNDS FOR THE SMALLEST SINGULAR VALUE OF STRUCTURED RANDOM MATRICES By Nicholas Cook University of California, Los Angeles We obtain
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 informationInvertibility of random matrices
University of Michigan February 2011, Princeton University Origins of Random Matrix Theory Statistics (Wishart matrices) PCA of a multivariate Gaussian distribution. [Gaël Varoquaux s blog gael-varoquaux.info]
More informationarxiv: v1 [math.pr] 22 May 2008
THE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n 1/2 ) arxiv:0805.3407v1 [math.pr] 22 May 2008 MARK RUDELSON AND ROMAN VERSHYNIN Abstract. Let A be a matrix whose entries are real i.i.d. centered
More 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 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 informationConcentration Inequalities for Random Matrices
Concentration Inequalities for Random Matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify the asymptotic
More information, then the ESD of the matrix converges to µ cir almost surely as n tends to.
CIRCULAR LAW FOR RANDOM DISCRETE MATRICES OF GIVEN ROW SUM HOI H. NGUYEN AND VAN H. VU Abstract. Let M n be a random matrix of size n n and let λ 1,..., λ n be the eigenvalues of M n. The empirical spectral
More informationComparison Method in Random Matrix Theory
Comparison Method in Random Matrix Theory Jun Yin UW-Madison Valparaíso, Chile, July - 2015 Joint work with A. Knowles. 1 Some random matrices Wigner Matrix: H is N N square matrix, H : H ij = H ji, EH
More informationRandom matrices: Distribution of the least singular value (via Property Testing)
Random matrices: Distribution of the least singular value (via Property Testing) Van H. Vu Department of Mathematics Rutgers vanvu@math.rutgers.edu (joint work with T. Tao, UCLA) 1 Let ξ be a real or complex-valued
More informationSemicircle law on short scales and delocalization for Wigner random matrices
Semicircle law on short scales and delocalization for Wigner random matrices László Erdős University of Munich Weizmann Institute, December 2007 Joint work with H.T. Yau (Harvard), B. Schlein (Munich)
More informationIII. Quantum ergodicity on graphs, perspectives
III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +
More informationAnti-concentration Inequalities
Anti-concentration Inequalities Roman Vershynin Mark Rudelson University of California, Davis University of Missouri-Columbia Phenomena in High Dimensions Third Annual Conference Samos, Greece June 2007
More informationEigenvalue variance bounds for Wigner and covariance random matrices
Eigenvalue variance bounds for Wigner and covariance random matrices S. Dallaporta University of Toulouse, France Abstract. This work is concerned with finite range bounds on the variance of individual
More informationLocal law of addition of random matrices
Local law of addition of random matrices Kevin Schnelli IST Austria Joint work with Zhigang Bao and László Erdős Supported by ERC Advanced Grant RANMAT No. 338804 Spectrum of sum of random matrices Question:
More informationRANDOM MATRICES: OVERCROWDING ESTIMATES FOR THE SPECTRUM. 1. introduction
RANDOM MATRICES: OVERCROWDING ESTIMATES FOR THE SPECTRUM HOI H. NGUYEN Abstract. We address overcrowding estimates for the singular values of random iid matrices, as well as for the eigenvalues of random
More informationRESEARCH STATEMENT ANIRBAN BASAK
RESEARCH STATEMENT ANIRBAN BASAK 1. Introduction I am interested in all areas of theoretical and applied probability. Specifically, I have worked on problems on hermitian and non-hermitian random matrices.
More informationThe rank of random regular digraphs of constant degree
The rank of random regular digraphs of constant degree Alexander E. Litvak Anna Lytova Konstantin Tikhomirov Nicole Tomczak-Jaegermann Pierre Youssef Abstract Let d be a (large) integer. Given n 2d, let
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 informationLecture 3. Random Fourier measurements
Lecture 3. Random Fourier measurements 1 Sampling from Fourier matrices 2 Law of Large Numbers and its operator-valued versions 3 Frames. Rudelson s Selection Theorem Sampling from Fourier matrices Our
More informationarxiv: v3 [math.pr] 8 Oct 2017
Complex Random Matrices have no Real Eigenvalues arxiv:1609.07679v3 [math.pr] 8 Oct 017 Kyle Luh Abstract Let ζ = ξ + iξ where ξ, ξ are iid copies of a mean zero, variance one, subgaussian random variable.
More informationInvertibility of symmetric random matrices
Invertibility of symmetric random matrices Roman Vershynin University of Michigan romanv@umich.edu February 1, 2011; last revised March 16, 2012 Abstract We study n n symmetric random matrices H, possibly
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationLocal semicircle law, Wegner estimate and level repulsion for Wigner random matrices
Local semicircle law, Wegner estimate and level repulsion for Wigner random matrices László Erdős University of Munich Oberwolfach, 2008 Dec Joint work with H.T. Yau (Harvard), B. Schlein (Cambrigde) Goal:
More 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 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 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 informationarxiv: v2 [math.fa] 7 Apr 2010
Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Non-asymptotic theory of random matrices: extreme singular values arxiv:1003.2990v2 [math.fa] 7 Apr 2010 Mark Rudelson,
More informationConcentration and Anti-concentration. Van H. Vu. Department of Mathematics Yale University
Concentration and Anti-concentration Van H. Vu Department of Mathematics Yale University Concentration and Anti-concentration X : a random variable. Concentration and Anti-concentration X : a random variable.
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 informationRANDOM MATRICES: TAIL BOUNDS FOR GAPS BETWEEN EIGENVALUES. 1. Introduction
RANDOM MATRICES: TAIL BOUNDS FOR GAPS BETWEEN EIGENVALUES HOI NGUYEN, TERENCE TAO, AND VAN VU Abstract. Gaps (or spacings) between consecutive eigenvalues are a central topic in random matrix theory. The
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 informationLeast singular value of random matrices. Lewis Memorial Lecture / DIMACS minicourse March 18, Terence Tao (UCLA)
Least singular value of random matrices Lewis Memorial Lecture / DIMACS minicourse March 18, 2008 Terence Tao (UCLA) 1 Extreme singular values Let M = (a ij ) 1 i n;1 j m be a square or rectangular matrix
More informationRANDOM MATRICES: LAW OF THE DETERMINANT
RANDOM MATRICES: LAW OF THE DETERMINANT HOI H. NGUYEN AND VAN H. VU Abstract. Let A n be an n by n random matrix whose entries are independent real random variables with mean zero and variance one. We
More informationUpper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1
Upper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1 Feng Wei 2 University of Michigan July 29, 2016 1 This presentation is based a project under the supervision of M. Rudelson.
More informationExtreme eigenvalues of Erdős-Rényi random graphs
Extreme eigenvalues of Erdős-Rényi random graphs Florent Benaych-Georges j.w.w. Charles Bordenave and Antti Knowles MAP5, Université Paris Descartes May 18, 2018 IPAM UCLA Inhomogeneous Erdős-Rényi random
More informationEIGENVECTORS OF RANDOM MATRICES OF SYMMETRIC ENTRY DISTRIBUTIONS. 1. introduction
EIGENVECTORS OF RANDOM MATRICES OF SYMMETRIC ENTRY DISTRIBUTIONS SEAN MEEHAN AND HOI NGUYEN Abstract. In this short note we study a non-degeneration property of eigenvectors of symmetric random matrices
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 informationInverse Theorems in Probability. Van H. Vu. Department of Mathematics Yale University
Inverse Theorems in Probability Van H. Vu Department of Mathematics Yale University Concentration and Anti-concentration X : a random variable. Concentration and Anti-concentration X : a random variable.
More informationDeterminantal point processes and random matrix theory in a nutshell
Determinantal point processes and random matrix theory in a nutshell part II Manuela Girotti based on M. Girotti s PhD thesis, A. Kuijlaars notes from Les Houches Winter School 202 and B. Eynard s notes
More informationTHE SPARSE CIRCULAR LAW UNDER MINIMAL ASSUMPTIONS
THE SPARSE CIRCULAR LAW UNDER MINIMAL ASSUMPTIONS MARK RUDELSON AND KONSTANTIN TIKHOMIROV Abstract. The circular law asserts that the empirical distribution of eigenvalues of appropriately normalized n
More informationRandom matrices: A Survey. Van H. Vu. Department of Mathematics Rutgers University
Random matrices: A Survey Van H. Vu Department of Mathematics Rutgers University Basic models of random matrices Let ξ be a real or complex-valued random variable with mean 0 and variance 1. Examples.
More informationarxiv: v4 [math.pr] 13 Mar 2012
AROUND THE CIRCULAR LAW CHARLES BORDENAVE AND DJALIL CHAFAÏ arxiv:1109.3343v4 [math.pr] 13 Mar 2012 Abstract. These expository notes are centered around the circular law theorem, which states that the
More informationarxiv: v5 [math.na] 16 Nov 2017
RANDOM PERTURBATION OF LOW RANK MATRICES: IMPROVING CLASSICAL BOUNDS arxiv:3.657v5 [math.na] 6 Nov 07 SEAN O ROURKE, VAN VU, AND KE WANG Abstract. Matrix perturbation inequalities, such as Weyl s theorem
More informationTHE EIGENVALUES AND EIGENVECTORS OF FINITE, LOW RANK PERTURBATIONS OF LARGE RANDOM MATRICES
THE EIGENVALUES AND EIGENVECTORS OF FINITE, LOW RANK PERTURBATIONS OF LARGE RANDOM MATRICES FLORENT BENAYCH-GEORGES AND RAJ RAO NADAKUDITI Abstract. We consider the eigenvalues and eigenvectors of finite,
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationREPORT DOCUMENTATION PAGE
Form Approved OMB No. 0704-088 REPORT DOCUMENTATION PAGE Public report ing burden for this collection of informat ion is estimated to average hour per response, including the time for reviewing instructions,
More informationNon white sample covariance matrices.
Non white sample covariance matrices. S. Péché, Université Grenoble 1, joint work with O. Ledoit, Uni. Zurich 17-21/05/2010, Université Marne la Vallée Workshop Probability and Geometry in High Dimensions
More 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 informationIndependence and chromatic number (and random k-sat): Sparse Case. Dimitris Achlioptas Microsoft
Independence and chromatic number (and random k-sat): Sparse Case Dimitris Achlioptas Microsoft Random graphs W.h.p.: with probability that tends to 1 as n. Hamiltonian cycle Let τ 2 be the moment all
More informationThe uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008
The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 Emmanuel Candés (Caltech), Terence Tao (UCLA) 1 Uncertainty principles A basic principle
More informationRandom Matrices for Big Data Signal Processing and Machine Learning
Random Matrices for Big Data Signal Processing and Machine Learning (ICASSP 2017, New Orleans) Romain COUILLET and Hafiz TIOMOKO ALI CentraleSupélec, France March, 2017 1 / 153 Outline Basics of Random
More informationA note on a Marčenko-Pastur type theorem for time series. Jianfeng. Yao
A note on a Marčenko-Pastur type theorem for time series Jianfeng Yao Workshop on High-dimensional statistics The University of Hong Kong, October 2011 Overview 1 High-dimensional data and the sample covariance
More informationReconstruction from Anisotropic Random Measurements
Reconstruction from Anisotropic Random Measurements Mark Rudelson and Shuheng Zhou The University of Michigan, Ann Arbor Coding, Complexity, and Sparsity Workshop, 013 Ann Arbor, Michigan August 7, 013
More informationConvergence of spectral measures and eigenvalue rigidity
Convergence of spectral measures and eigenvalue rigidity Elizabeth Meckes Case Western Reserve University ICERM, March 1, 2018 Macroscopic scale: the empirical spectral measure Macroscopic scale: the empirical
More informationarxiv: v3 [math.pr] 9 Nov 2015
ON THE SINGULARITY OF ADJACENCY MATRICES FOR RANDOM REGULAR DIGRAPHS NICHOLAS A. COOK arxiv:1411.0243v3 [math.pr] 9 Nov 2015 Abstract. We prove that the non-symmetric adjacency matrix of a uniform random
More informationThe Gaussian free field, Gibbs measures and NLS on planar domains
The Gaussian free field, Gibbs measures and on planar domains N. Burq, joint with L. Thomann (Nantes) and N. Tzvetkov (Cergy) Université Paris Sud, Laboratoire de Mathématiques d Orsay, CNRS UMR 8628 LAGA,
More informationLUCK S THEOREM ALEX WRIGHT
LUCK S THEOREM ALEX WRIGHT Warning: These are the authors personal notes for a talk in a learning seminar (October 2015). There may be incorrect or misleading statements. Corrections welcome. 1. Convergence
More informationRandom Fermionic Systems
Random Fermionic Systems Fabio Cunden Anna Maltsev Francesco Mezzadri University of Bristol December 9, 2016 Maltsev (University of Bristol) Random Fermionic Systems December 9, 2016 1 / 27 Background
More informationFluctuations of random tilings and discrete Beta-ensembles
Fluctuations of random tilings and discrete Beta-ensembles Alice Guionnet CRS (E S Lyon) Advances in Mathematics and Theoretical Physics, Roma, 2017 Joint work with A. Borodin, G. Borot, V. Gorin, J.Huang
More informationFluctuations of random tilings and discrete Beta-ensembles
Fluctuations of random tilings and discrete Beta-ensembles Alice Guionnet CRS (E S Lyon) Workshop in geometric functional analysis, MSRI, nov. 13 2017 Joint work with A. Borodin, G. Borot, V. Gorin, J.Huang
More informationSpectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues László Erdős Antti Knowles 2 Horng-Tzer Yau 2 Jun Yin 2 Institute of Mathematics, University of Munich, Theresienstrasse
More information285K Homework #1. Sangchul Lee. April 28, 2017
285K Homework #1 Sangchul Lee April 28, 2017 Problem 1. Suppose that X is a Banach space with respect to two norms: 1 and 2. Prove that if there is c (0, such that x 1 c x 2 for each x X, then there is
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 informationarxiv: v4 [math.pr] 10 Sep 2018
Lectures on the local semicircle law for Wigner matrices arxiv:60.04055v4 [math.pr] 0 Sep 208 Florent Benaych-Georges Antti Knowles September, 208 These notes provide an introduction to the local semicircle
More informationStein s Method for Matrix Concentration
Stein s Method for Matrix Concentration Lester Mackey Collaborators: Michael I. Jordan, Richard Y. Chen, Brendan Farrell, and Joel A. Tropp University of California, Berkeley California Institute of Technology
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 informationTHE SMALLEST SINGULAR VALUE OF A RANDOM RECTANGULAR MATRIX
THE SMALLEST SINGULAR VALUE OF A RANDOM RECTANGULAR MATRIX MARK RUDELSON AND ROMAN VERSHYNIN Abstract. We prove an optimal estimate of the smallest singular value of a random subgaussian matrix, valid
More informationarxiv: v4 [math.pr] 10 Mar 2015
EXPONENTIAL BOUNDS FOR THE SUPPORT CONVERGENCE IN THE SINGLE RING THEOREM FLORENT BENAYCH-GEORGES arxiv:1409.3864v4 [math.pr] 10 Mar 2015 Abstract. We consider an n n matrix of the form A = UTV, with U,
More informationStrong Convergence of the Empirical Distribution of Eigenvalues of Large Dimensional Random Matrices
Strong Convergence of the Empirical Distribution of Eigenvalues of Large Dimensional Random Matrices by Jack W. Silverstein* Department of Mathematics Box 8205 North Carolina State University Raleigh,
More informationTHE LITTLEWOOD-OFFORD PROBLEM AND INVERTIBILITY OF RANDOM MATRICES
THE LITTLEWOOD-OFFORD PROBLEM AND INVERTIBILITY OF RANDOM MATRICES MARK RUDELSON AND ROMAN VERSHYNIN Abstract. We prove two basic conjectures on the distribution of the smallest singular value of random
More informationarxiv: v3 [math-ph] 21 Jun 2012
LOCAL MARCHKO-PASTUR LAW AT TH HARD DG OF SAMPL COVARIAC MATRICS CLAUDIO CACCIAPUOTI, AA MALTSV, AD BJAMI SCHLI arxiv:206.730v3 [math-ph] 2 Jun 202 Abstract. Let X be a matrix whose entries are i.i.d.
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 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 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 informationFree Probability, Sample Covariance Matrices and Stochastic Eigen-Inference
Free Probability, Sample Covariance Matrices and Stochastic Eigen-Inference Alan Edelman Department of Mathematics, Computer Science and AI Laboratories. E-mail: edelman@math.mit.edu N. Raj Rao Deparment
More informationHow long does it take to compute the eigenvalues of a random symmetric matrix?
How long does it take to compute the eigenvalues of a random symmetric matrix? Govind Menon (Brown University) Joint work with: Christian Pfrang (Ph.D, Brown 2011) Percy Deift, Tom Trogdon (Courant Institute)
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 informationSpectra of Large Random Stochastic Matrices & Relaxation in Complex Systems
Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems Reimer Kühn Disordered Systems Group Department of Mathematics, King s College London Random Graphs and Random Processes, KCL
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 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 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 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 informationPCA with random noise. Van Ha Vu. Department of Mathematics Yale University
PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical
More informationFree probabilities and the large N limit, IV. Loop equations and all-order asymptotic expansions... Gaëtan Borot
Free probabilities and the large N limit, IV March 27th 2014 Loop equations and all-order asymptotic expansions... Gaëtan Borot MPIM Bonn & MIT based on joint works with Alice Guionnet, MIT Karol Kozlowski,
More informationThe largest eigenvalues of the sample covariance matrix. in the heavy-tail case
The largest eigenvalues of the sample covariance matrix 1 in the heavy-tail case Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia NY), Johannes Heiny (Aarhus University)
More informationA Brief Introduction to Functional Analysis
A Brief Introduction to Functional Analysis Sungwook Lee Department of Mathematics University of Southern Mississippi sunglee@usm.edu July 5, 2007 Definition 1. An algebra A is a vector space over C with
More informationEXTENDED GLRT DETECTORS OF CORRELATION AND SPHERICITY: THE UNDERSAMPLED REGIME. Xavier Mestre 1, Pascal Vallet 2
EXTENDED GLRT DETECTORS OF CORRELATION AND SPHERICITY: THE UNDERSAMPLED REGIME Xavier Mestre, Pascal Vallet 2 Centre Tecnològic de Telecomunicacions de Catalunya, Castelldefels, Barcelona (Spain) 2 Institut
More informationUniversality for random matrices and log-gases
Universality for random matrices and log-gases László Erdős IST, Austria Ludwig-Maximilians-Universität, Munich, Germany Encounters Between Discrete and Continuous Mathematics Eötvös Loránd University,
More informationLarge sample covariance matrices and the T 2 statistic
Large sample covariance matrices and the T 2 statistic EURANDOM, the Netherlands Joint work with W. Zhou Outline 1 2 Basic setting Let {X ij }, i, j =, be i.i.d. r.v. Write n s j = (X 1j,, X pj ) T and
More informationarxiv: v1 [cs.na] 6 Jan 2017
SPECTRAL STATISTICS OF LATTICE GRAPH STRUCTURED, O-UIFORM PERCOLATIOS Stephen Kruzick and José M. F. Moura 2 Carnegie Mellon University, Department of Electrical Engineering 5000 Forbes Avenue, Pittsburgh,
More informationSHARP TRANSITION OF THE INVERTIBILITY OF THE ADJACENCY MATRICES OF SPARSE RANDOM GRAPHS
SHARP TRANSITION OF THE INVERTIBILITY OF THE ADJACENCY MATRICES OF SPARSE RANDOM GRAPHS ANIRBAN BASAK AND MARK RUDELSON Abstract. We consider three different models of sparse random graphs: undirected
More informationMatrix estimation by Universal Singular Value Thresholding
Matrix estimation by Universal Singular Value Thresholding Courant Institute, NYU Let us begin with an example: Suppose that we have an undirected random graph G on n vertices. Model: There is a real symmetric
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 informationSpectral Universality of Random Matrices
Spectral Universality of Random Matrices László Erdős IST Austria (supported by ERC Advanced Grant) Szilárd Leó Colloquium Technical University of Budapest February 27, 2018 László Erdős Spectral Universality
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 9, SEPTEMBER
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 9, SEPTEMBER 2008 3987 A New Approach for Mutual Information Analysis of Large Dimensional Multi-Antenna Channels Walid Hachem, Member, IEEE, Oleksiy
More information