Strong Convergence of the Empirical Distribution of Eigenvalues of Large Dimensional Random Matrices
|
|
- Shannon Hunt
- 6 years ago
- Views:
Transcription
1 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, North Carolina Summary Let X be n N containing i.i.d. complex entries with E X EX 2 =,andt an n n random Hermitian non-negative definite, independent of X. Assume, almost surely, as n, the empirical distribution function (e.d.f.) of the eigenvalues of T converges in distribution, and the ratio n/n tends to a positive number. Then it is shown that, almost surely, the e.d.f. of the eigenvalues of (/N )XX T converges in distribution. The limit is nonrandom and is characteried in terms of its Stieltjes transform, which satisfies a certain equation. * Supported by the National Science Foundation under grant DMS AMS 99 subject classifications. Primary 60F5; Secondary 62H99. Key Words and Phrases. Random matrix, empirical distribution function of eigenvalues, Stieltjes transform.
2 . Introduction. For any square matrix A with only real eigenvalues, let F A denote the empirical distribution function (e.d.f.) of the eigenvalues of A (that is, F A (x) isthe proportion of eigenvalues of A x). This paper continues the work on the e.d.f. of the eigenvalues of matrices of the form (/N )XX T,whereX is n N containing i.i.d. complex entries with E X EX 2 =,T is n n random Hermitian non-negative definite, independent of X, andn, N are large but on the same order of magnitude. Assuming the entries of X and T to be real, it is shown in Yin [4] that, if n and N both converge to infinity while their ratio n/n converges to a positive quantity c, and the moments of F T converge almost surely to those of a nonrandom probability distribution function (p.d.f.) H satisfying the Carleman sufficiency condition, then, with probability one, F (/N )XX T converges in distribution to a nonrandom p.d.f. F. The aim of this paper is to extend the limit theorem to the complex case, with arbitrary H having mass on [0, ), assuming convergence in distribution of F T to H almost surely. Obviously the method of moments, used in the proof of the limit theorem in Yin [4], cannot be further relied on. As will be seen, the key tool in understanding both the (/N )XX T limiting behavior of F and analytic properties of F is the Stieltjes transform, defined for any p.d.f. G as the analytic function m G () λ dg(λ) C+ { C : Im > 0}. Due to the inversion formula G{[a, b]} = b π lim Imm G (ξ + iη)dξ η 0 + a (a, b continuity points of G), convergence in distribution of a tight sequence of p.d.f. s is guaranteed once convergence of the corresponding Stieltjes transforms on a countable subset in C + possessing at least one accumulation point is verified. One reason for using the Stieltjes tranform to characterie spectral e.d.f s is the simple way it can be expressed in terms of the resolvent of the matrix. Indeed, for p pahaving real eigenvalues λ,...,λ p, m F A() =(/p) p i= λ i =(/p)tr (A I) (tr denoting trace, and I the identity matrix). Stieltjes transform methods are used in Marčenko and Pastur [] on matrices of the form A +(/N )X TX, where the entries of X have finite absolute fourth moments (independence is replaced by a mild dependency condition reflected in their mixed second and fourth moments), T = diag(τ,...,τ n ) with τ i s i.i.d. having p.d.f. H where H is an
3 arbitrary p.d.f. on R, anda is N N nonrandom Hermitian with F A converging vaguely to a (possibly degenerate) distribution function. For ease of exposition, we confine our discussion only to the case A = 0. It is proven that F (/N )X TX (x) i.p. F (x) for all x 0 (it can be shown that F is absolutely continuous away from 0. See Silverstein and Choi [3] for results on the analytic behavior of F and F ), where m F is the solution to ( ) τdh(τ) (.) m = c +τm in the sense that, for every C +, m = m F () is the unique solution in C + to (.). Under the assumptions on X originally given in this paper, strong convergence for T diagonal is proven in Silverstein and Bai [2] with no restriction on {τ,...,τ n } other than its e.d.f. converges in distribution to H almost surely. The proof takes an approach more direct than in Marčenko and Pastur [] (which involves the construction of a certain partial differential equation), providing a clear understanding of why m F satisfies (.), at the same time displaying where random behavior primarily comes into play (basically from Lemma 2. given below). The difference between the spectra of (/N )XX T and (/N )X TX is n N ero eigenvalues, expressed via their e.d.f. s by the relation F (/N )X TX =( n N )I [0, ) + n N F (/N )XX T (I B denoting the indicator function on the set B). It follows that their Stieltjes transforms satisfy (.2) m F (/N )X TX() = ( n N ) + n N m F (/N )XX T () C +. Therefore, in the limit (when F and F are known to exist) F =( c) [0, ) + cf, and ( c) (.3) m F () = + cm F () C +. From (.) and (.3) it is straightfoward to conclude that for each C +, m = m F () is a solution to (.4) m = τ( c cm) dh(τ). 2
4 It is unique in the set {m C : ( c) + cm C + }. It is remarked here that (.) reveals much of the analytic behavior of F, and consequently F (Silverstein and Choi [3]), and should be viewed as another indication of the importance of Stieltjes transforms to these types of matrices. Even when H has all moments, it seems unlikely much information about F can be extracted from the explicit expressions for the moments of F given in Yin [4]. Using again the Stieltjes transform as the essential tool in analying convergence, this paper will establish strong convergence of F (/N )XX T to F under the weakest assumptions on non-negative definite T. In order to keep notation to a minimum, the statement of the result and its proof will be expressed in terms of the Hermitian matrix (/N )T /2 XX T /2, T /2 denoting a Hermitian square root of T The following theorem will be proven. Theorem.. Assume on a common probability space a) For n =, 2,... X n =(Xij n ), n N, Xn ij C, i.d. for all n, i, j, independent across i, j for each n, E X EX 2 =. b) N = N(n) with n/n c>0asn. c) T n n n random Hermitian non-negative definite, with F T n converging almost surely in distribution to a p.d.f. H on [0, ) asn. d) X n and T n are independent. Let Tn /2 be the Hermitian non-negative square root of T n, and let B n = (/N )Tn /2 X n XnT n /2 (obviously F B n = F (/N )X nx n T n ). Then, almost surely, F B n converges in distribution, as n, to a (nonrandom) p.d.f. F, whose Stieltjes transform m() ( C + ) satisfies (.4), in the sense that, for each C +, m = m() is the unique solution to (.4) in D c {m C : ( c) + cm C + }. The proof will be given in the next section. Much of the groundwork has already been laid out in Silverstein and Bai [2], in particular the first step, which is to truncate and centralie the entries of X, and Lemma 2.. Therefore we will, on occasion, refer the reader to the latter paper for further details. 3
5 Proof of Theorem.. As in Silverstein and Bai [2], the dependency of the variables on n will occasionally be dropped. Through two successive stages of truncations and centraliations (truncate at ± N, centralie, truncate at ± ln N, centralie) and a final scaling, the main part of section 3 in Silverstein and Bai [2] argues that the assumptions on the entries of X can be replaced by standardied variables bounded in absolute value by a fixed multiple of ln N. WriteT in its spectral decompositon: T = U(diag(τ,...,τ n ))U. By replacing the diagonal matrix T α in that paper with U(diag(τ I (τ α),...,τ n I (τn α)))u, exactly the same argument applies in the present case. However, the following proof requires truncation of the eigenvalues of T. It is shown in Silverstein and Bai [2] (and used in section 3) that for any N n matrix Q, ifα = α n then F QT Q F QT αq a.s. 0 as n, where here denotes the sup norm on functions. Therefore, we may assume along with the conditions in Theorem. ) X log n, where log n denotes the logarithm of n with a certain base (defined in Silverstein and Bai [2]), 2) EX =0,E X 2 = 3) T log n, where here and throughout the following denotes the spectral norm on matrices. The following two results are derived in Silverstein and Bai [2]. The first accounts for much of the truth of Theorem. due to random behavior. The second relies on the following fact (which contributes much to the form of equation (.4)): For n nband q C n for which B and B + qq are invertible, (2.) q (B + qq ) = +q B q q B, (follows from q B (B + qq )=(+q B q)q ). Lemma 2. (Lemma 3. of Silverstein and Bai [2]). Let C be an n n matrix with C, and Y =(X,...,X n ) T, where the X i s are i.i.d. satisfying conditions ) and 2) above. Then E Y CY tr C 6 Kn 3 log 2 n where the constant K does not depend on n, C, nor on the distribution of X. Lemma 2.2 (Lemma 2.6 of Silverstein and Bai [2]). Let C + with v = Im, A and B n n with B Hermitian, and q C n. Then tr ( (B I) (B + τqq I) ) A A v. 4
6 The next lemma contains some additional inequalities. Lemma 2.3. For = u + iv C + let m (), m 2 () be Stieltjes transforms of any two p.d.f. s, A and Bn n with A Hermitian non-negative definite, and r C n. Then a) (m ()A + I) max(4 A /v, 2) b) tr B((m ()A+I) (m 2 ()A+I) ) m 2 () m () n B A (max(4 A /v, 2)) 2 c) r B(m ()A+I) r r B(m 2 ()A+I) r m 2 () m () r 2 B A (max(4 A /v, 2)) 2 ( r denoting Euclidean norm on r). Proof: Notice b) and c) follow easily from a) using basic matrix properties. We have for any positive x m ()x + 2 =(Re m ()x +) 2 +(Imm ()) 2 x 2. Using the Cauchy- Schwar inequality it is easy to show Re m () (Imm ()/v) /2. This leads us to consider minimiing over m the expression (vx) 2 m 4 +(mx +) 2, or with y = mx the function f(y) =ay 4 +(y +) 2 where a =(v/x) 2. Upon considering y on either side of /2 we find f(y) min(a/6, /4), from which a) follows. We proceed with the proof of Theorem. Fix = u + iv C +. Let B n =(/N )X TX, m n = m F Bn,andm n = m F B n. Let c n = n/n. In Silverstein and Bai [2] it is argued that, almost surely, the sequence {F B n}, for diagonal T, is tight. The argument carries directly over to the present case. Thus the quantity δ = inf Imm vdf B n(λ) n() inf n n 2(λ 2 + u 2 )+v 2 is positive almost surely. For j =, 2,...,N,letq j =(/ n)x j (X j denoting the j th column of X), r j = (/ N)T /2 X j,andb (j) = B n (j) = B n r j r j.write B n I + I = r j rj. Taking the inverse of B n I on the right on both sides and using (2.) we find I + (B n I) = j= j= +r j (B (j) I) r j r j r j (B (j) I). 5
7 Taking the trace on both sides and dividing by N we have c n + c n m n = N j= r j (B (j) I) r j +r j (B (j) I) r j = N j= +r j (B (j) I) r j. From (.2) we see that (2.2) m n () = N j= ( + r j (B (j) I) r j ). For each j we have Imr j ((/)B (j) I) r j = 2i r j ( ((/)B(j) I) ((/)B (j) I) ) r j Therefore (2.3) = v 2 r j ((/)B (j) I) B (j) ((/)B (j) I) r j 0. ( + r j (B (j) I) r j ) v. Write B n I ( m n ()T n I ) = N j= r jr j ( m n())t n. Taking inverses and using (2.), (2.2) we have ( m n ()T n I) (B n I) =( m n ()T n I) [ N = j= j= r j r j ( m n ())T n ] (B n I) ] [(m (+rj (B (j) I) r j ) n ()T n +I) r j r j (B (j) I) N (m n()t n +I) T n (B n I). Taking the trace and dividing by n we find (2.4) n tr ( m n()t n I) m n () = N where j= ( + r j (B (j) I) r j ) d j d j = q j T /2 (B (j) I) (m n ()T n + I) T /2 q j n tr (m n()t n + I) T n (B n I). From Lemma 2.2 we see max j N m n() m F B (j) () nv. 6
8 p Let for each jm (j) () = ( c n) + c n m B F (j) (). From (.2) we have for any positive (2.5) max j N logp n m n () m (j) () 0 as n. Also, by writing m (j) () = N + ( N N )( ( n N ) ) + n N m F B (j) (), from (.2) we see that m (j) is the Stieltjes transform of a p.d.f. Using condition 3), Lemma 2., Lemma 2.3 a), the fact that q j is independent of both B (j) and m (j) (), and (A I) /v for any Hermitian matrix A, we find and for n sufficiently large E q j 2 6 K log2 n n 3 E q j T /2 (B (j) I) (m (j) ()T n + I) T /2 q j n tr T /2 (B (j) I) (m (j) ()T n + I) T /2 6 K46 v 2 Therefore we have almost surely as n (2.6) max j N max[ q j 2, q j T /2 (B (j) I) (m (j) ()T n + I) T /2 q j log 24 n n 3. n tr T /2 (B (j) I) (m (j) ()T n + I) T /2 ] 0. We concentrate on a realiation for which (2.6) holds, {F B n } is tight (implying δ>0), and F T n converges in distribution to H. From condition 3), Lemma 2.2, Lemma 2.3 b), c), (2.5), and (2.6) we find that max d j 0asn. Therefore, from (2.3), (2.4) j N n tr ( m n()t n I) m n () 0 as n. Consider a subsequence {n i } on which {m ni ()} (bounded in absolute value by /v) converges to a number m. Letm = ( c) + cm be the corresponding limit of m ni (). We have Imm δ so that m D c. We use the fact that for m C +, τ R, /(m τ +) m /Im m and τ/(m τ +) /Im m to conclude that the function f(τ) = mτ + 7
9 is bounded and satisfies m ni ()τ + f(τ) m δ 2 m n i () m. Therefore n tr ( m n i ()T n I) = m ni τ + df T n i (τ) mτ + dh(τ) as n. Thus m satisfies (.4). Since m is unique we have m n () m. Thus, with probability one, F B n converges in distribution to F having Stieltjes transform defined through (.4). This completes the proof of Theorem.. 8
10 REFERENCES [] V. A. MarčenkoandL. A. Pastur, Distribution of eigenvalues for some sets of random matrices, USSR-Sb., (967), pp [2] J. W. Silverstein and Z. D. Bai, On the empirical distribution of eigenvalues of a class of large dimensional random matrices, J. Multivariate Anal. 54 (995), pp [3] J. W. Silverstein and S.I. Choi, Analysis of the limiting spectral distribution of large dimensional random matrices, J. Multivariate Anal. 54 (995), pp [4] Y. Q. Yin, Limiting spectral distribution for a class of random matrices, J. Multivariate Anal. 20 (986), pp
INVERSE EIGENVALUE STATISTICS FOR RAYLEIGH AND RICIAN MIMO CHANNELS
INVERSE EIGENVALUE STATISTICS FOR RAYLEIGH AND RICIAN MIMO CHANNELS E. Jorswieck, G. Wunder, V. Jungnickel, T. Haustein Abstract Recently reclaimed importance of the empirical distribution function of
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 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 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 informationEigenvectors of some large sample covariance matrix ensembles
Probab. Theory Relat. Fields DOI 0.007/s00440-00-0298-3 Eigenvectors of some large sample covariance matrix ensembles Olivier Ledoit Sandrine Péché Received: 24 March 2009 / Revised: 0 March 200 Springer-Verlag
More informationEstimation of the Global Minimum Variance Portfolio in High Dimensions
Estimation of the Global Minimum Variance Portfolio in High Dimensions Taras Bodnar, Nestor Parolya and Wolfgang Schmid 07.FEBRUARY 2014 1 / 25 Outline Introduction Random Matrix Theory: Preliminary Results
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 informationLARGE DIMENSIONAL RANDOM MATRIX THEORY FOR SIGNAL DETECTION AND ESTIMATION IN ARRAY PROCESSING
LARGE DIMENSIONAL RANDOM MATRIX THEORY FOR SIGNAL DETECTION AND ESTIMATION IN ARRAY PROCESSING J. W. Silverstein and P. L. Combettes Department of Mathematics, North Carolina State University, Raleigh,
More informationIrina Pchelintseva A FIRST-ORDER SPECTRAL PHASE TRANSITION IN A CLASS OF PERIODICALLY MODULATED HERMITIAN JACOBI MATRICES
Opuscula Mathematica Vol. 8 No. 008 Irina Pchelintseva A FIRST-ORDER SPECTRAL PHASE TRANSITION IN A CLASS OF PERIODICALLY MODULATED HERMITIAN JACOBI MATRICES Abstract. We consider self-adjoint unbounded
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 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 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 informationOn corrections of classical multivariate tests for high-dimensional data. Jian-feng. Yao Université de Rennes 1, IRMAR
Introduction a two sample problem Marčenko-Pastur distributions and one-sample problems Random Fisher matrices and two-sample problems Testing cova On corrections of classical multivariate tests for high-dimensional
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 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 informationSpectral analysis of the Moore-Penrose inverse of a large dimensional sample covariance matrix
Spectral analysis of the Moore-Penrose inverse of a large dimensional sample covariance matrix Taras Bodnar a, Holger Dette b and Nestor Parolya c a Department of Mathematics, Stockholm University, SE-069
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 informationInternational Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994
International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible
More informationEigenvectors of some large sample covariance matrix ensembles.
oname manuscript o. (will be inserted by the editor) Eigenvectors of some large sample covariance matrix ensembles. Olivier Ledoit Sandrine Péché Received: date / Accepted: date AbstractWe consider sample
More informationOn singular values distribution of a matrix large auto-covariance in the ultra-dimensional regime. Title
itle On singular values distribution of a matrix large auto-covariance in the ultra-dimensional regime Authors Wang, Q; Yao, JJ Citation Random Matrices: heory and Applications, 205, v. 4, p. article no.
More informationNumerical Solutions to the General Marcenko Pastur Equation
Numerical Solutions to the General Marcenko Pastur Equation Miriam Huntley May 2, 23 Motivation: Data Analysis A frequent goal in real world data analysis is estimation of the covariance matrix of some
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 informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationBanach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable Sequences
Advances in Dynamical Systems and Applications ISSN 0973-532, Volume 6, Number, pp. 9 09 20 http://campus.mst.edu/adsa Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationRandom Matrix Theory Lecture 1 Introduction, Ensembles and Basic Laws. Symeon Chatzinotas February 11, 2013 Luxembourg
Random Matrix Theory Lecture 1 Introduction, Ensembles and Basic Laws Symeon Chatzinotas February 11, 2013 Luxembourg Outline 1. Random Matrix Theory 1. Definition 2. Applications 3. Asymptotics 2. Ensembles
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 informationSpectrum for compact operators on Banach spaces
Submitted to Journal of the Mathematical Society of Japan Spectrum for compact operators on Banach spaces By Luis Barreira, Davor Dragičević Claudia Valls (Received Nov. 22, 203) (Revised Jan. 23, 204)
More informationMath212a1413 The Lebesgue integral.
Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the
More informationOn corrections of classical multivariate tests for high-dimensional data
On corrections of classical multivariate tests for high-dimensional data Jian-feng Yao with Zhidong Bai, Dandan Jiang, Shurong Zheng Overview Introduction High-dimensional data and new challenge in statistics
More information4th Preparation Sheet - Solutions
Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space
More informationON THE UNIQUENESS OF SOLUTIONS TO THE GROSS-PITAEVSKII HIERARCHY. 1. Introduction
ON THE UNIQUENESS OF SOLUTIONS TO THE GROSS-PITAEVSKII HIERARCHY SERGIU KLAINERMAN AND MATEI MACHEDON Abstract. The purpose of this note is to give a new proof of uniqueness of the Gross- Pitaevskii hierarchy,
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 informationInstitut für Mathematik
U n i v e r s i t ä t A u g s b u r g Institut für Mathematik Martin Rasmussen, Peter Giesl A Note on Almost Periodic Variational Equations Preprint Nr. 13/28 14. März 28 Institut für Mathematik, Universitätsstraße,
More informationDesign of MMSE Multiuser Detectors using Random Matrix Techniques
Design of MMSE Multiuser Detectors using Random Matrix Techniques Linbo Li and Antonia M Tulino and Sergio Verdú Department of Electrical Engineering Princeton University Princeton, New Jersey 08544 Email:
More informationA NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS
A NOTE ON ALMOST PERIODIC VARIATIONAL EQUATIONS PETER GIESL AND MARTIN RASMUSSEN Abstract. The variational equation of a nonautonomous differential equation ẋ = F t, x) along a solution µ is given by ẋ
More informationRandom regular digraphs: singularity and spectrum
Random regular digraphs: singularity and spectrum Nick Cook, UCLA Probability Seminar, Stanford University November 2, 2015 Universality Circular law Singularity probability Talk outline 1 Universality
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More information11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.
C PROPERTIES OF MATRICES 697 to whether the permutation i 1 i 2 i N is even or odd, respectively Note that I =1 Thus, for a 2 2 matrix, the determinant takes the form A = a 11 a 12 = a a 21 a 11 a 22 a
More informationLinear Algebra: Characteristic Value Problem
Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number
More informationInhomogeneous circular laws for random matrices with non-identically distributed entries
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
More informationAdditive functionals of infinite-variance moving averages. Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535
Additive functionals of infinite-variance moving averages Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535 Departments of Statistics The University of Chicago Chicago, Illinois 60637 June
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
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 informationarxiv: v1 [math.pr] 13 Aug 2007
The Annals of Probability 2007, Vol. 35, No. 4, 532 572 DOI: 0.24/009790600000079 c Institute of Mathematical Statistics, 2007 arxiv:0708.720v [math.pr] 3 Aug 2007 ON ASYMPTOTICS OF EIGENVECTORS OF LARGE
More informationNonparametric Eigenvalue-Regularized Precision or Covariance Matrix Estimator
Nonparametric Eigenvalue-Regularized Precision or Covariance Matrix Estimator Clifford Lam Department of Statistics, London School of Economics and Political Science Abstract We introduce nonparametric
More informationMarkov operators, classical orthogonal polynomial ensembles, and random matrices
Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random
More informationRandom Matrix Theory and its Applications to Econometrics
Random Matrix Theory and its Applications to Econometrics Hyungsik Roger Moon University of Southern California Conference to Celebrate Peter Phillips 40 Years at Yale, October 2018 Spectral Analysis of
More informationA Conceptual Proof of the Kesten-Stigum Theorem for Multi-type Branching Processes
Classical and Modern Branching Processes, Springer, New Yor, 997, pp. 8 85. Version of 7 Sep. 2009 A Conceptual Proof of the Kesten-Stigum Theorem for Multi-type Branching Processes by Thomas G. Kurtz,
More informationA remark on the maximum eigenvalue for circulant matrices
IMS Collections High Dimensional Probability V: The Luminy Volume Vol 5 (009 79 84 c Institute of Mathematical Statistics, 009 DOI: 04/09-IMSCOLL5 A remark on the imum eigenvalue for circulant matrices
More informationThe properties of L p -GMM estimators
The properties of L p -GMM estimators Robert de Jong and Chirok Han Michigan State University February 2000 Abstract This paper considers Generalized Method of Moment-type estimators for which a criterion
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 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 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 informationFunctional Analysis F3/F4/NVP (2005) Homework assignment 3
Functional Analysis F3/F4/NVP (005 Homework assignment 3 All students should solve the following problems: 1. Section 4.8: Problem 8.. Section 4.9: Problem 4. 3. Let T : l l be the operator defined by
More informationarxiv: v1 [math.pr] 10 Dec 2009
The Annals of Applied Probability 2009, Vol. 9, No. 6, 2362 2405 DOI: 0.24/08-AAP548 c Institute of Mathematical Statistics, 2009 arxiv:092.950v [math.pr] 0 Dec 2009 CONCENTRATION OF MEASURE AND SPECTRA
More informationSpectral Efficiency of CDMA Cellular Networks
Spectral Efficiency of CDMA Cellular Networks N. Bonneau, M. Debbah, E. Altman and G. Caire INRIA Eurecom Institute nicolas.bonneau@sophia.inria.fr Outline 2 Outline Uplink CDMA Model: Single cell case
More informationMETHODOLOGIES IN SPECTRAL ANALYSIS OF LARGE DIMENSIONAL RANDOM MATRICES, A REVIEW
Statistica Sinica 9(1999), 611-677 METHODOLOGIES IN SPECTRAL ANALYSIS OF LARGE DIMENSIONAL RANDOM MATRICES, A REVIEW Z. D. Bai National University of Singapore Abstract: In this paper, we give a brief
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 informationInequalities Relating Addition and Replacement Type Finite Sample Breakdown Points
Inequalities Relating Addition and Replacement Type Finite Sample Breadown Points Robert Serfling Department of Mathematical Sciences University of Texas at Dallas Richardson, Texas 75083-0688, USA Email:
More informationGaussian Random Fields
Gaussian Random Fields Mini-Course by Prof. Voijkan Jaksic Vincent Larochelle, Alexandre Tomberg May 9, 009 Review Defnition.. Let, F, P ) be a probability space. Random variables {X,..., X n } are called
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES
Volume 10 (2009), Issue 4, Article 91, 5 pp. ON THE HÖLDER CONTINUITY O MATRIX UNCTIONS OR NORMAL MATRICES THOMAS P. WIHLER MATHEMATICS INSTITUTE UNIVERSITY O BERN SIDLERSTRASSE 5, CH-3012 BERN SWITZERLAND.
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 informationAppendix B for The Evolution of Strategic Sophistication (Intended for Online Publication)
Appendix B for The Evolution of Strategic Sophistication (Intended for Online Publication) Nikolaus Robalino and Arthur Robson Appendix B: Proof of Theorem 2 This appendix contains the proof of Theorem
More information10.1. The spectrum of an operator. Lemma If A < 1 then I A is invertible with bounded inverse
10. Spectral theory For operators on finite dimensional vectors spaces, we can often find a basis of eigenvectors (which we use to diagonalize the matrix). If the operator is symmetric, this is always
More informationStochastic Design Criteria in Linear Models
AUSTRIAN JOURNAL OF STATISTICS Volume 34 (2005), Number 2, 211 223 Stochastic Design Criteria in Linear Models Alexander Zaigraev N. Copernicus University, Toruń, Poland Abstract: Within the framework
More informationWeiming Li and Jianfeng Yao
LOCAL MOMENT ESTIMATION OF POPULATION SPECTRUM 1 A LOCAL MOMENT ESTIMATOR OF THE SPECTRUM OF A LARGE DIMENSIONAL COVARIANCE MATRIX Weiming Li and Jianfeng Yao arxiv:1302.0356v1 [stat.me] 2 Feb 2013 Abstract:
More informationAsymptotic Statistics-III. Changliang Zou
Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (
More informationCONCENTRATION OF THE MIXED DISCRIMINANT OF WELL-CONDITIONED MATRICES. Alexander Barvinok
CONCENTRATION OF THE MIXED DISCRIMINANT OF WELL-CONDITIONED MATRICES Alexander Barvinok Abstract. We call an n-tuple Q 1,...,Q n of positive definite n n real matrices α-conditioned for some α 1 if for
More informationQuantile Processes for Semi and Nonparametric Regression
Quantile Processes for Semi and Nonparametric Regression Shih-Kang Chao Department of Statistics Purdue University IMS-APRM 2016 A joint work with Stanislav Volgushev and Guang Cheng Quantile Response
More informationNotes on Random Vectors and Multivariate Normal
MATH 590 Spring 06 Notes on Random Vectors and Multivariate Normal Properties of Random Vectors If X,, X n are random variables, then X = X,, X n ) is a random vector, with the cumulative distribution
More informationNumerical Range of non-hermitian random Ginibre matrices and the Dvoretzky theorem
Numerical Range of non-hermitian random Ginibre matrices and the Dvoretzky theorem Karol Życzkowski Institute of Physics, Jagiellonian University, Cracow and Center for Theoretical Physics, PAS, Warsaw
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationOn the Set of Limit Points of Normed Sums of Geometrically Weighted I.I.D. Bounded Random Variables
On the Set of Limit Points of Normed Sums of Geometrically Weighted I.I.D. Bounded Random Variables Deli Li 1, Yongcheng Qi, and Andrew Rosalsky 3 1 Department of Mathematical Sciences, Lakehead University,
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 informationMultiuser Receivers, Random Matrices and Free Probability
Multiuser Receivers, Random Matrices and Free Probability David N.C. Tse Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720, USA dtse@eecs.berkeley.edu
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 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 informationWeighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More informationBULK SPECTRUM: WIGNER AND MARCHENKO-PASTUR THEOREMS
BULK SPECTRUM: WIGNER AND MARCHENKO-PASTUR THEOREMS 1. GAUSSIAN ORTHOGONAL AND UNITARY ENSEMBLES Definition 1. A random symmetric, N N matrix X chosen from the Gaussian orthogonal ensemble (abbreviated
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 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 informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationSelf-normalized Cramér-Type Large Deviations for Independent Random Variables
Self-normalized Cramér-Type Large Deviations for Independent Random Variables Qi-Man Shao National University of Singapore and University of Oregon qmshao@darkwing.uoregon.edu 1. Introduction Let X, X
More informationRITZ VALUE BOUNDS THAT EXPLOIT QUASI-SPARSITY
RITZ VALUE BOUNDS THAT EXPLOIT QUASI-SPARSITY ILSE C.F. IPSEN Abstract. Absolute and relative perturbation bounds for Ritz values of complex square matrices are presented. The bounds exploit quasi-sparsity
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 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 informationLecture 7: Semidefinite programming
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 7: Semidefinite programming This lecture is on semidefinite programming, which is a powerful technique from both an analytic and computational
More informationThe Dynamics of Learning: A Random Matrix Approach
The Dynamics of Learning: A Random Matrix Approach ICML 2018, Stockholm, Sweden Zhenyu Liao, Romain Couillet L2S, CentraleSupélec, Université Paris-Saclay, France GSTATS IDEX DataScience Chair, GIPSA-lab,
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
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 information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationComparison of perturbation bounds for the stationary distribution of a Markov chain
Linear Algebra and its Applications 335 (00) 37 50 www.elsevier.com/locate/laa Comparison of perturbation bounds for the stationary distribution of a Markov chain Grace E. Cho a, Carl D. Meyer b,, a Mathematics
More informationDiagonalization by a unitary similarity transformation
Physics 116A Winter 2011 Diagonalization by a unitary similarity transformation In these notes, we will always assume that the vector space V is a complex n-dimensional space 1 Introduction A semi-simple
More information