A remark on the maximum eigenvalue for circulant matrices
|
|
- Stuart Nash
- 5 years ago
- Views:
Transcription
1 IMS Collections High Dimensional Probability V: The Luminy Volume Vol 5 ( c Institute of Mathematical Statistics, 009 DOI: 04/09-IMSCOLL5 A remark on the imum eigenvalue for circulant matrices W lodek Bryc and Sunder Sethuraman University of Cincinnati and Iowa State University Abstract: We point out that the method of Davis-Mikosch [Ann Probab 7 ( ] gives for a symmetric circulant n n matrix composed of iid entries with mean 0 and finite ( + δ-moments in the first half-row that the imum eigenvalue is on the order n log n, and the fluctuations are Gumbel Let {X 0,X,} be iid mean-zero, variance, random variables For m, consider the (m + (m + palindromic circulant matrix X 0 X X X m X m X m X ( X m X m X 0 X X X m X X X 3 X m X m X m X 0 In this note, we observe, for circulant matrices (, that an argument of [] for the imum of periodograms easily applies to deduce that the imum eigenvalue is on the order m log m, and the fluctuations are Gumbel (Theorem In particular, a sort of universality with respect to the entries {X i }, much discussed in other contexts in the random matrix literature, is established for the asymptotic imum eigenvalue distribution We refer to [3] for more discussion of random circulant matrices, and note the result for Gaussian entries is as well given in [3, Corollary 5] Theorem Suppose X,X, are iid with E(X = 0, E(X =,and E( X s < for some s> Denotebyλ m the imum eigenvalue of (, and let a m = logm log(4π log m/ ( logm Then lim m P (( λm a m logm x = G(x where G(x =exp( e x The proof follows closely the method used to prove [, Theorem ] which is based on Einmahl s multivariate extension of the Komlos-Major-Tusnady theorem Department of Mathematical Sciences, University of Cincinnati, 855 Campus Way, PO Box 005, Cincinnati, OH , USA, WlodzimierzBryc@UCedu Department of Mathematics, 396 Carver Hall, Iowa State University, Ames, IA 500, USA, sethuram@iastateedu Keywords and phrases: imum, eigenvalue, circulant, Gumbel, random, matrix AMS 000 subject classifications: Primary 5A5 79
2 80 W Bryc and S Sethuraman (cf Lemma 3 Indeed, Lemmas 4, 5 are similar to [, Lemmas 33, 34] with analogous proofs The well known Bonferroni inequalities (Lemma and Lemma 3 are stated as [, Lemmas 3, 3] Lemma Let A,,A n be measurable events Then for every k n/, k d= ( d S d P (A A n where S d = j < j d n P (A j A jd ( d S d, k The next statement is Einmahl s Corollary (b, page 3, in combination with the Remark on page 3 [] Lemma 3 Let ξ,,ξ n be independent random vectors in R d Assume that the moment generating function of {ξ i } exists in a neighborhood of the origin, and that d= cov(ξ + + ξ n =B n I d, where B n > 0 and I d is the d dimensional identity matrix Let η k be independent N(0,σ cov(ξ k random vectors for k n independent of {ξ i },and0 <σ Let ξk = ξ k + η k for k n, andwritep n as the density of Bn / n ξ k Choose 0 <α</ such that ( α Let n E ξ k 3 exp(α ξ k B n (3 β n = β n (α = B 3/ n If n E ξ k 3 exp(α ξ k (4 x c αb / n, σ c β n log β n and B n c 3 α, where c,c,c 3 are constants depending only on d, then (5 p n(x = φ (+σ I d (xexp( T n (x with T n (x c 4 β n ( x 3 +, where φ C is the density of the d-dimensional centered Gaussian vector with covariance matrix C and c 4 is a constant depending only on d Let now {X j } j 0 be as in Theorem For j, m 0, define X j = X j E(X Xj m /s /s X m Lemma 4 We have as that m ( πjk X k m + m + m ( πjk X (m k = O(m / m + X (m j =
3 A remark on the imum eigenvalue for circulant matrices 8 Proof First, we can add and subtract (m + / X0 on the left-side Since we can replace with + m X 0 + ( πjk m + m X 0 X0 m /s + m = 0, ( πjk X k m + ( πjk X k m + Xk m /s Now, by Borel-Cantelli, as t P ( X t >t /s <, wehave X t t /s for all t N(ω as Then, m m X t X t Xt m = X /s t Xt >m /s N(ω N(ω X t Xt >m /s + m t=n(ω+ X t Xt >m /s + t>n(ω for m {N(ω, X s,, X N(ω s } Hence, the sums m ( πjk X k m + and agree for all large m as We finish by noting the extra term m X t Xt >t /s X t Xt >t /s = 0 ( πjk X k m + Xk m /s [ X 0 X 0 X0 m /s] = E[X 0 X0 m /s] = O(m / For d, define v d (t = ( πjt m+,,( πj dt m+ with respect to distinct integers j,,j d m Let also {N j } be a sequence of iid N(0, random variables independent of {X j } Lemma 5 For d, let p m be the density of E[ X ](m +[ ( X0 + σ m N 0 vd (0 + m ( Xk + σ m N k vd (k] where σ m = E[ X ]s mifm c5 log m s m for c 5 =/ ( δ/s > 0 and some 0 <δ<, then, uniformly for x 3 = o(m / /s, p m (x =φ (+smi d (x( + o(
4 8 W Bryc and S Sethuraman Proof Apply Lemma 3 to the centered vectors X 0 v d (0, X v d (, X m v d (m where, after some calculation, cov( X0 v d (0 + X v d ( + + X m v d (m = B m I d and [ B m = E X m ( ] πk +4 m + Choose for a fixed constant c 6 > 0, = (m +E X Note for each 0 t m, that Then, for large m, v d (t = α = c 6 m /s d / d l= αe X 0 v d (0 3 exp{ α X 0 v d (0} + α ( πjl t m + d m E X t v d (t 3 exp { α X t v d (t } 8d 3/ α(m +E X 3 exp { α X d /} 0dc 6 m /s E X 3 exp { } c 6 } 0dc 6 exp{4c 6 m δ/s E X +δ where 0 <δ<ischosensothate X +δ < Then, ( holds with α = α for sufficiently small c 6 Now choose β m = Bm 3/ E X 0 v d (0 3 exp{ α X 0 v d (0} +B 3/ m m E X t v d (t 3 exp { α X t v d (t } 8d 3/ B 3/ m (m +E X 3 exp { α X d /} Then, β m const(bm 3/ m +( δ/s E X +δ const(m c5 where c 5 =/ ( δ/s > 0 Next, we consider (4 We can choose x so that Then, we can choose σ = s m so that x c αb / m const(m / /s s m const(m c5 log m and note Noting (5, we have B m m c 3 α m /s p m = φ (+s m I d (xexp ( Tm (x with T m (x c 4 βm ( x 3 +
5 A remark on the imum eigenvalue for circulant matrices 83 However, uniformly over x 3 = o(m / /s, T m (x c 4 βm ( x 3 + const(m / /s c5 = const(m δ/s = o( Proof of Theorem From properties of circulants, we have that the eigenvalues of ( are λ j = X 0 + m ( πkj m+ Xk for 0 j m, andalsoλ j = λ m+ j for j m Sincem / logm 0, the variable X 0 in the expression for λ j can be replaced by X 0 We will also be able to omit the contribution of λ 0 to the imum By Lemma 4, it will be enough to prove [ (6 X 0 m ( πjk ] logm + X k a m G m + m + m + To this end, let σ m = E[ X ]s m = E[ X ]m c5 log m Wefirstshow [ ( X 0 + σ m N 0 logm E[ X ](m + (7 + E[ X ](m + For j m, let m λ X+N j = ( X0 + σ m N 0 + E[ X ](m +[ Since e e u statement P ( πjk ( m + X ] k + σ m N k a m m G ( πjk ( m + X ] k + σ m N k = d= ( d (e du /d!, by Lemma, (7 will follow from the ( λ X+N j >a m + u logm,,λ X+N j d >a m + u logm (8 = m d exp( du( + o( uniformly over the d-tuples j < <j d m for each d asm Let A d m denote the event in the probability on the left-side Then, noting s m = m c5 log m, φ (+s m I d (xdx = m d exp{ du}( + o( A d m as m Note that we can neglect the parts in (8 when there is l d such that λ X+N j l 3 > m / /s ɛ for a small ɛ>0 Indeed, given d ands>choose0<ε</ /s and γ>such that γ(/ /s ε >d+ Note also / E[ X ] formlarge enough Then, by Rosenthal s inequality there is a constant C(γ such that P m X0 + ( πjl k m + C(γ m γ( /s ɛ ( C(γ 3 X k >m /s ɛ ( m 3γ/ E X k + me X 3γ k=0 m γ(/ /s ε + m = o(m d m γ( 4/s ε
6 84 W Bryc and S Sethuraman On the other hand, also P N0 m ( πjl k 3 + σ m N k m + m + m + >m / /s ε = o(m d We conclude by Lemma 5 (which does not depend on the choice of j,,j d that (8 holds To deduce (6, note E[ X ] E[X ] =, and (9 σm N 0 m ( X0 + σ m N 0 + m + X0 m + σm N 0 + ( πjk ( σ m N k m + m ( πjk m + m ( πjk X k m + m + m ( πjk σ m N k m + m + ( X k + σ m N k Let (m + / λ N j = σ m N 0 + m (πjk/m +σ mn k for j m One can calculate that that {λ N j }m j= are iid N(0,σ m variables Hence, to finish, the bounds (9 correspond to the imum of m iid N(0,σm random variables, well known to be on order σ m logm m c 5 log m 0in probability Acknowledgement The authors benefited from a discussion with Magda Peligrad References [] Davis, R A and Mikosch, T (999 The imum of the periodogram of a non-gaussian sequence Ann Probab [] Einmahl, U (989 Extensions of results of Komlos, Major and Tusnady to the multivariate case J Multivariate Anal [3] Meckes, M W (009 Some results on random circulant matrices IMS Coll 5 3-3
Lecture 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 informationAsymptotic results for empirical measures of weighted sums of independent random variables
Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Workshop on Limit Theorems, University Paris 1 Paris, January
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 informationHan-Ying Liang, Dong-Xia Zhang, and Jong-Il Baek
J. Korean Math. Soc. 41 (2004), No. 5, pp. 883 894 CONVERGENCE OF WEIGHTED SUMS FOR DEPENDENT RANDOM VARIABLES Han-Ying Liang, Dong-Xia Zhang, and Jong-Il Baek Abstract. We discuss in this paper the strong
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 informationAsymptotic results for empirical measures of weighted sums of independent random variables
Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Seminario di Probabilità e Statistica Matematica Sapienza Università
More informationSums of exponentials of random walks
Sums of exponentials of random walks Robert de Jong Ohio State University August 27, 2009 Abstract This paper shows that the sum of the exponential of an oscillating random walk converges in distribution,
More informationChapter 6. Order Statistics and Quantiles. 6.1 Extreme Order Statistics
Chapter 6 Order Statistics and Quantiles 61 Extreme Order Statistics Suppose we have a finite sample X 1,, X n Conditional on this sample, we define the values X 1),, X n) to be a permutation of X 1,,
More informationEcon 508B: Lecture 5
Econ 508B: Lecture 5 Expectation, MGF and CGF Hongyi Liu Washington University in St. Louis July 31, 2017 Hongyi Liu (Washington University in St. Louis) Math Camp 2017 Stats July 31, 2017 1 / 23 Outline
More informationLARGE DEVIATION PROBABILITIES FOR SUMS OF HEAVY-TAILED DEPENDENT RANDOM VECTORS*
LARGE EVIATION PROBABILITIES FOR SUMS OF HEAVY-TAILE EPENENT RANOM VECTORS* Adam Jakubowski Alexander V. Nagaev Alexander Zaigraev Nicholas Copernicus University Faculty of Mathematics and Computer Science
More informationA NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES
Bull. Korean Math. Soc. 52 (205), No. 3, pp. 825 836 http://dx.doi.org/0.434/bkms.205.52.3.825 A NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES Yongfeng Wu and Mingzhu
More informationAn almost sure central limit theorem for the weight function sequences of NA random variables
Proc. ndian Acad. Sci. (Math. Sci.) Vol. 2, No. 3, August 20, pp. 369 377. c ndian Academy of Sciences An almost sure central it theorem for the weight function sequences of NA rom variables QUNYNG WU
More informationDISTRIBUTION OF EIGENVALUES FOR THE ENSEMBLE OF REAL SYMMETRIC TOEPLITZ MATRICES
DISTRIBUTIO OF EIGEVALUES FOR THE ESEMBLE OF REAL SYMMETRIC TOEPLITZ MATRICES CHRISTOPHER HAMMOD AD STEVE J. MILLER Abstract. Consider the ensemble of real symmetric Toeplitz matrices, each independent
More informationMOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES
J. Korean Math. Soc. 47 1, No., pp. 63 75 DOI 1.4134/JKMS.1.47..63 MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES Ke-Ang Fu Li-Hua Hu Abstract. Let X n ; n 1 be a strictly stationary
More informationConvergence of Random Variables
1 / 15 Convergence of Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay March 19, 2014 2 / 15 Motivation Theorem (Weak
More informationHomework # , Spring Due 14 May Convergence of the empirical CDF, uniform samples
Homework #3 36-754, Spring 27 Due 14 May 27 1 Convergence of the empirical CDF, uniform samples In this problem and the next, X i are IID samples on the real line, with cumulative distribution function
More informationOptimal rates of convergence for estimating Toeplitz covariance matrices
Probab. Theory Relat. Fields 2013) 156:101 143 DOI 10.1007/s00440-012-0422-7 Optimal rates of convergence for estimating Toeplitz covariance matrices T. Tony Cai Zhao Ren Harrison H. Zhou Received: 17
More informationSection 27. The Central Limit Theorem. Po-Ning Chen, Professor. Institute of Communications Engineering. National Chiao Tung University
Section 27 The Central Limit Theorem Po-Ning Chen, Professor Institute of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 3000, R.O.C. Identically distributed summands 27- Central
More informationChapter 6. Convergence. Probability Theory. Four different convergence concepts. Four different convergence concepts. Convergence in probability
Probability Theory Chapter 6 Convergence Four different convergence concepts Let X 1, X 2, be a sequence of (usually dependent) random variables Definition 1.1. X n converges almost surely (a.s.), or with
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationSelf-normalized laws of the iterated logarithm
Journal of Statistical and Econometric Methods, vol.3, no.3, 2014, 145-151 ISSN: 1792-6602 print), 1792-6939 online) Scienpress Ltd, 2014 Self-normalized laws of the iterated logarithm Igor Zhdanov 1 Abstract
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 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 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 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 informationMi-Hwa Ko. t=1 Z t is true. j=0
Commun. Korean Math. Soc. 21 (2006), No. 4, pp. 779 786 FUNCTIONAL CENTRAL LIMIT THEOREMS FOR MULTIVARIATE LINEAR PROCESSES GENERATED BY DEPENDENT RANDOM VECTORS Mi-Hwa Ko Abstract. Let X t be an m-dimensional
More informationIntroduction to Self-normalized Limit Theory
Introduction to Self-normalized Limit Theory Qi-Man Shao The Chinese University of Hong Kong E-mail: qmshao@cuhk.edu.hk Outline What is the self-normalization? Why? Classical limit theorems Self-normalized
More informationStrong approximation for additive functionals of geometrically ergodic Markov chains
Strong approximation for additive functionals of geometrically ergodic Markov chains Florence Merlevède Joint work with E. Rio Université Paris-Est-Marne-La-Vallée (UPEM) Cincinnati Symposium on Probability
More informationExercises in Extreme value theory
Exercises in Extreme value theory 2016 spring semester 1. Show that L(t) = logt is a slowly varying function but t ǫ is not if ǫ 0. 2. If the random variable X has distribution F with finite variance,
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
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 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 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 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 informationThe Multivariate Normal Distribution 1
The Multivariate Normal Distribution 1 STA 302 Fall 2017 1 See last slide for copyright information. 1 / 40 Overview 1 Moment-generating Functions 2 Definition 3 Properties 4 χ 2 and t distributions 2
More informationAsymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½
University of Pennsylvania ScholarlyCommons Statistics Papers Wharton Faculty Research 1998 Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½ Lawrence D. Brown University
More informationLycka till!
Avd. Matematisk statistik TENTAMEN I SF294 SANNOLIKHETSTEORI/EXAM IN SF294 PROBABILITY THE- ORY MONDAY THE 14 T H OF JANUARY 28 14. p.m. 19. p.m. Examinator : Timo Koski, tel. 79 71 34, e-post: timo@math.kth.se
More informationConvergence of the long memory Markov switching model to Brownian motion
Convergence of the long memory Marov switching model to Brownian motion Changryong Bae Sungyunwan University Natércia Fortuna CEF.UP, Universidade do Porto Vladas Pipiras University of North Carolina February
More informationChapter 2: Fundamentals of Statistics Lecture 15: Models and statistics
Chapter 2: Fundamentals of Statistics Lecture 15: Models and statistics Data from one or a series of random experiments are collected. Planning experiments and collecting data (not discussed here). Analysis:
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,
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 informationBahadur representations for bootstrap quantiles 1
Bahadur representations for bootstrap quantiles 1 Yijun Zuo Department of Statistics and Probability, Michigan State University East Lansing, MI 48824, USA zuo@msu.edu 1 Research partially supported by
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 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 informationarxiv: v1 [math.pr] 29 Dec 2015
Royen s proof of the Gaussian correlation inequality arxiv:5.8776v [math.pr] 9 Dec 5 Rafa l Lata la and Dariusz Matlak Abstract We present in detail Thomas Royen s proof of the Gaussian correlation inequality
More informationA Martingale Central Limit Theorem
A Martingale Central Limit Theorem Sunder Sethuraman We present a proof of a martingale central limit theorem (Theorem 2) due to McLeish (974). Then, an application to Markov chains is given. Lemma. For
More informationScaling exponents for certain 1+1 dimensional directed polymers
Scaling exponents for certain 1+1 dimensional directed polymers Timo Seppäläinen Department of Mathematics University of Wisconsin-Madison 2010 Scaling for a polymer 1/29 1 Introduction 2 KPZ equation
More informationDistribution of Eigenvalues for the Ensemble of Real Symmetric Toeplitz Matrices
Journal of Theoretical Probability, Vol. 18, No. 3, July 2005 ( 2005) DOI: 10.1007/s10959-005-3518-5 Distribution of Eigenvalues for the Ensemble of Real Symmetric Toeplitz Matrices Christopher Hammond
More informationMaximal inequalities and a law of the. iterated logarithm for negatively. associated random fields
Maximal inequalities and a law of the arxiv:math/0610511v1 [math.pr] 17 Oct 2006 iterated logarithm for negatively associated random fields Li-Xin ZHANG Department of Mathematics, Zhejiang University,
More informationMethods for sparse analysis of high-dimensional data, II
Methods for sparse analysis of high-dimensional data, II Rachel Ward May 23, 2011 High dimensional data with low-dimensional structure 300 by 300 pixel images = 90, 000 dimensions 2 / 47 High dimensional
More informationStatistical signal processing
Statistical signal processing Short overview of the fundamentals Outline Random variables Random processes Stationarity Ergodicity Spectral analysis Random variable and processes Intuition: A random variable
More informationConvergence Concepts of Random Variables and Functions
Convergence Concepts of Random Variables and Functions c 2002 2007, Professor Seppo Pynnonen, Department of Mathematics and Statistics, University of Vaasa Version: January 5, 2007 Convergence Modes Convergence
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 informationRectangular Young tableaux and the Jacobi ensemble
Rectangular Young tableaux and the Jacobi ensemble Philippe Marchal October 20, 2015 Abstract It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau
More informationAsymptotic normality of the L k -error of the Grenander estimator
Asymptotic normality of the L k -error of the Grenander estimator Vladimir N. Kulikov Hendrik P. Lopuhaä 1.7.24 Abstract: We investigate the limit behavior of the L k -distance between a decreasing density
More informationSubmitted to the Brazilian Journal of Probability and Statistics
Submitted to the Brazilian Journal of Probability and Statistics Multivariate normal approximation of the maximum likelihood estimator via the delta method Andreas Anastasiou a and Robert E. Gaunt b a
More informationMATH 6605: SUMMARY LECTURE NOTES
MATH 6605: SUMMARY LECTURE NOTES These notes summarize the lectures on weak convergence of stochastic processes. If you see any typos, please let me know. 1. Construction of Stochastic rocesses A stochastic
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 informationAlmost Sure Central Limit Theorem for Self-Normalized Partial Sums of Negatively Associated Random Variables
Filomat 3:5 (207), 43 422 DOI 0.2298/FIL70543W Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Almost Sure Central Limit Theorem
More informationWittmann Type Strong Laws of Large Numbers for Blockwise m-negatively Associated Random Variables
Journal of Mathematical Research with Applications Mar., 206, Vol. 36, No. 2, pp. 239 246 DOI:0.3770/j.issn:2095-265.206.02.03 Http://jmre.dlut.edu.cn Wittmann Type Strong Laws of Large Numbers for Blockwise
More informationDe-biasing the Lasso: Optimal Sample Size for Gaussian Designs
De-biasing the Lasso: Optimal Sample Size for Gaussian Designs Adel Javanmard USC Marshall School of Business Data Science and Operations department Based on joint work with Andrea Montanari Oct 2015 Adel
More informationarxiv:math/ v1 [math.pr] 24 Apr 2003
ICM 2002 Vol. III 1 3 arxiv:math/0304373v1 [math.pr] 24 Apr 2003 Estimates for the Strong Approximation in Multidimensional Central Limit Theorem A. Yu. Zaitsev Abstract In a recent paper the author obtained
More informationAsymptotic Inference for High Dimensional Data
Asymptotic Inference for High Dimensional Data Jim Kuelbs Department of Mathematics University of Wisconsin Madison, WI 53706-1388 Anand N. Vidyashankar Department of Statistical Science Cornell University
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 informationProbability and Measure
Chapter 4 Probability and Measure 4.1 Introduction In this chapter we will examine probability theory from the measure theoretic perspective. The realisation that measure theory is the foundation of probability
More informationProbability Background
Probability Background Namrata Vaswani, Iowa State University August 24, 2015 Probability recap 1: EE 322 notes Quick test of concepts: Given random variables X 1, X 2,... X n. Compute the PDF of the second
More informationTriangular matrices and biorthogonal ensembles
/26 Triangular matrices and biorthogonal ensembles Dimitris Cheliotis Department of Mathematics University of Athens UK Easter Probability Meeting April 8, 206 2/26 Special densities on R n Example. n
More information(Part 1) High-dimensional statistics May / 41
Theory for the Lasso Recall the linear model Y i = p j=1 β j X (j) i + ɛ i, i = 1,..., n, or, in matrix notation, Y = Xβ + ɛ, To simplify, we assume that the design X is fixed, and that ɛ is N (0, σ 2
More informationMultivariate Random Variable
Multivariate Random Variable Author: Author: Andrés Hincapié and Linyi Cao This Version: August 7, 2016 Multivariate Random Variable 3 Now we consider models with more than one r.v. These are called multivariate
More informationMethods for sparse analysis of high-dimensional data, II
Methods for sparse analysis of high-dimensional data, II Rachel Ward May 26, 2011 High dimensional data with low-dimensional structure 300 by 300 pixel images = 90, 000 dimensions 2 / 55 High dimensional
More informationt x 1 e t dt, and simplify the answer when possible (for example, when r is a positive even number). In particular, confirm that EX 4 = 3.
Mathematical Statistics: Homewor problems General guideline. While woring outside the classroom, use any help you want, including people, computer algebra systems, Internet, and solution manuals, but mae
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction
More informationA CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN. Dedicated to the memory of Mikhail Gordin
A CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN Dedicated to the memory of Mikhail Gordin Abstract. We prove a central limit theorem for a square-integrable ergodic
More informationThe Multivariate Normal Distribution 1
The Multivariate Normal Distribution 1 STA 302 Fall 2014 1 See last slide for copyright information. 1 / 37 Overview 1 Moment-generating Functions 2 Definition 3 Properties 4 χ 2 and t distributions 2
More information. Find E(V ) and var(v ).
Math 6382/6383: Probability Models and Mathematical Statistics Sample Preliminary Exam Questions 1. A person tosses a fair coin until she obtains 2 heads in a row. She then tosses a fair die the same number
More informationSingular value decomposition (SVD) of large random matrices. India, 2010
Singular value decomposition (SVD) of large random matrices Marianna Bolla Budapest University of Technology and Economics marib@math.bme.hu India, 2010 Motivation New challenge of multivariate statistics:
More informationGaussian vectors and central limit theorem
Gaussian vectors and central limit theorem Samy Tindel Purdue University Probability Theory 2 - MA 539 Samy T. Gaussian vectors & CLT Probability Theory 1 / 86 Outline 1 Real Gaussian random variables
More informationAsymptotically Efficient Nonparametric Estimation of Nonlinear Spectral Functionals
Acta Applicandae Mathematicae 78: 145 154, 2003. 2003 Kluwer Academic Publishers. Printed in the Netherlands. 145 Asymptotically Efficient Nonparametric Estimation of Nonlinear Spectral Functionals M.
More informationCentral Limit Theorem for Non-stationary Markov Chains
Central Limit Theorem for Non-stationary Markov Chains Magda Peligrad University of Cincinnati April 2011 (Institute) April 2011 1 / 30 Plan of talk Markov processes with Nonhomogeneous transition probabilities
More informationLarge sample distribution for fully functional periodicity tests
Large sample distribution for fully functional periodicity tests Siegfried Hörmann Institute for Statistics Graz University of Technology Based on joint work with Piotr Kokoszka (Colorado State) and Gilles
More informationPRECISE ASYMPTOTIC IN THE LAW OF THE ITERATED LOGARITHM AND COMPLETE CONVERGENCE FOR U-STATISTICS
PRECISE ASYMPTOTIC IN THE LAW OF THE ITERATED LOGARITHM AND COMPLETE CONVERGENCE FOR U-STATISTICS REZA HASHEMI and MOLUD ABDOLAHI Department of Statistics, Faculty of Science, Razi University, 67149, Kermanshah,
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
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 informationLimit Theorems for Exchangeable Random Variables via Martingales
Limit Theorems for Exchangeable Random Variables via Martingales Neville Weber, University of Sydney. May 15, 2006 Probabilistic Symmetries and Their Applications A sequence of random variables {X 1, X
More informationBASICS OF PROBABILITY
October 10, 2018 BASICS OF PROBABILITY Randomness, sample space and probability Probability is concerned with random experiments. That is, an experiment, the outcome of which cannot be predicted with certainty,
More informationThe Multivariate Normal Distribution. In this case according to our theorem
The Multivariate Normal Distribution Defn: Z R 1 N(0, 1) iff f Z (z) = 1 2π e z2 /2. Defn: Z R p MV N p (0, I) if and only if Z = (Z 1,..., Z p ) T with the Z i independent and each Z i N(0, 1). In this
More informationMODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT
Statistica Sinica 23 (2013), 1523-1540 doi:http://dx.doi.org/10.5705/ss.2012.203s MODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT Louis H. Y. Chen 1, Xiao Fang 1,2 and Qi-Man Shao 3 1 National
More informationMA8109 Stochastic Processes in Systems Theory Autumn 2013
Norwegian University of Science and Technology Department of Mathematical Sciences MA819 Stochastic Processes in Systems Theory Autumn 213 1 MA819 Exam 23, problem 3b This is a linear equation of the form
More informationZeros of lacunary random polynomials
Zeros of lacunary random polynomials Igor E. Pritsker Dedicated to Norm Levenberg on his 60th birthday Abstract We study the asymptotic distribution of zeros for the lacunary random polynomials. It is
More informationCOMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS
COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers
More informationThe Lindeberg central limit theorem
The Lindeberg central limit theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto May 29, 205 Convergence in distribution We denote by P d the collection of Borel probability
More informationAsymptotic Tail Probabilities of Sums of Dependent Subexponential Random Variables
Asymptotic Tail Probabilities of Sums of Dependent Subexponential Random Variables Jaap Geluk 1 and Qihe Tang 2 1 Department of Mathematics The Petroleum Institute P.O. Box 2533, Abu Dhabi, United Arab
More informationA generalization of Strassen s functional LIL
A generalization of Strassen s functional LIL Uwe Einmahl Departement Wiskunde Vrije Universiteit Brussel Pleinlaan 2 B-1050 Brussel, Belgium E-mail: ueinmahl@vub.ac.be Abstract Let X 1, X 2,... be a sequence
More informationMinimax Rate of Convergence for an Estimator of the Functional Component in a Semiparametric Multivariate Partially Linear Model.
Minimax Rate of Convergence for an Estimator of the Functional Component in a Semiparametric Multivariate Partially Linear Model By Michael Levine Purdue University Technical Report #14-03 Department of
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 informationRandom Vectors, Random Matrices, and Matrix Expected Value
Random Vectors, Random Matrices, and Matrix Expected Value James H. Steiger Department of Psychology and Human Development Vanderbilt University James H. Steiger (Vanderbilt University) 1 / 16 Random Vectors,
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 informationAn improved result in almost sure central limit theorem for self-normalized products of partial sums
Wu and Chen Journal of Inequalities and Applications 23, 23:29 http://www.ournalofinequalitiesandapplications.com/content/23//29 R E S E A R C H Open Access An improved result in almost sure central it
More informationPartitioned Covariance Matrices and Partial Correlations. Proposition 1 Let the (p + q) (p + q) covariance matrix C > 0 be partitioned as C = C11 C 12
Partitioned Covariance Matrices and Partial Correlations Proposition 1 Let the (p + q (p + q covariance matrix C > 0 be partitioned as ( C11 C C = 12 C 21 C 22 Then the symmetric matrix C > 0 has the following
More informationA Note on Tail Behaviour of Distributions. the max domain of attraction of the Frechét / Weibull law under power normalization
ProbStat Forum, Volume 03, January 2010, Pages 01-10 ISSN 0974-3235 A Note on Tail Behaviour of Distributions in the Max Domain of Attraction of the Frechét/ Weibull Law under Power Normalization S.Ravi
More information