Estimation of large dispersion and autocovariance matrices using banding and tapering Joint convergence of high dimensional generalized dispersion matrices Limiting spectral distribution of symmetric polynomials in sample autocovariance matrices and normality of traces Application of free probability in high dimensional time series Estimation of coefficient matrices in high dimensional autoregressive process

Large Covariance and Autocovariance Matrices brings together a collection of recent results on sample covariance and autocovariance matrices in high-dimensional models and novel ideas on how to use them for statistical inference in one or more high-dimensional time series models. The prerequisites include knowledge of elementary multivariate analysis, basic time series analysis and basic results in stochastic convergence. Part I is on different methods of estimation of large covariance matrices and auto-covariance matrices and properties of these estimators. Part II covers the relevant material on random matrix theory and non-commutative probability. Part III provides results on limit spectra and asymptotic normality of traces of symmetric matrix polynomial functions of sample auto-covariance matrices in high-dimensional linear time series models. These are used to develop graphical and significance tests for different hypotheses involving one or more independent high-dimensional linear time series. The book should be of interest to people in econometrics and statistics (large covariance matrices and high-dimensional time series), mathematics (random matrices and free probability) and computer science (wireless communication). Parts of it can be used in post-graduate courses on high-dimensional statistical inference, high-dimensional random matrices and high-dimensional time series models. It should be particularly attractive to researchers developing statistical methods in high-dimensional time series models. Arup Bose is a professor at the Indian Statistical Institute, Kolkata, India. He is a distinguished researcher in mathematical statistics and has been working in high-dimensional random matrices for the last fifteen years. He has been editor of Sankhyā for several years and has been on the editorial board of several other journals. He is a Fellow of the Institute of Mathematical Statistics, USA and all three national science academies of India, as well as the recipient of the S.S. Bhatnagar Award and the C.R. Rao Award. His first book Patterned Random Matrices was also published by Chapman & Hall. He has a forthcoming graduate text U-statistics, M-estimates and Resampling (with Snigdhansu Chatterjee) to be published by Hindustan Book Agency. Monika Bhattacharjee is a post-doctoral fellow at the Informatics Institute, University of Florida. After graduating from St. Xavier's College, Kolkata, she obtained her master’s in 2012 and PhD in 2016 from the Indian Statistical Institute. Her thesis in high-dimensional covariance and auto-covariance matrices, written under the supervision of Dr. Bose, has received high acclaim.

Methods for estimating sparse and large covariance matrices Covariance and correlation matrices play fundamental roles in every aspect of the analysis of multivariate data collected from a variety of fields including business and economics, health care, engineering, and environmental and physical sciences. High-Dimensional Covariance Estimation provides accessible and comprehensive coverage of the classical and modern approaches for estimating covariance matrices as well as their applications to the rapidly developing areas lying at the intersection of statistics and machine learning. Recently, the classical sample covariance methodologies have been modified and improved upon to meet the needs of statisticians and researchers dealing with large correlated datasets. High-Dimensional Covariance Estimation focuses on the methodologies based on shrinkage, thresholding, and penalized likelihood with applications to Gaussian graphical models, prediction, and mean-variance portfolio management. The book relies heavily on regression-based ideas and interpretations to connect and unify many existing methods and algorithms for the task. High-Dimensional Covariance Estimation features chapters on: Data, Sparsity, and Regularization Regularizing the Eigenstructure Banding, Tapering, and Thresholding Covariance Matrices Sparse Gaussian Graphical Models Multivariate Regression The book is an ideal resource for researchers in statistics, mathematics, business and economics, computer sciences, and engineering, as well as a useful text or supplement for graduate-level courses in multivariate analysis, covariance estimation, statistical learning, and high-dimensional data analysis.

Large dimensional random matrices (LDRM) with specific patterns arise in econometrics, computer science, mathematics, physics, and statistics. This book provides an easy initiation to LDRM. Through a unified approach, we investigate the existence and properties of the limiting spectral distribution (LSD) of different patterned random matrices as the dimension grows. The main ingredients are the method of moments and normal approximation with rudimentary combinatorics for support. Some elementary results from matrix theory are also used. By stretching the moment arguments, we also have a brush with the intriguing but difficult concepts of joint convergence of sequences of random matrices and its ramifications. This book covers the Wigner matrix, the sample covariance matrix, the Toeplitz matrix, the Hankel matrix, the sample autocovariance matrix and the k-Circulant matrices. Quick and simple proofs of their LSDs are provided and it is shown how the semi-circle law and the Marchenko-Pastur law arise as the LSDs of the first two matrices. Extending the basic approach, we also establish interesting limits for some triangular matrices, band matrices, balanced matrices, and the sample autocovariance matrix. We also study the joint convergence of several patterned matrices, and show that independent Wigner matrices converge jointly and are asymptotically free of other patterned matrices. Arup Bose is a Professor at the Indian Statistical Institute, Kolkata, India. He is a distinguished researcher in Mathematical Statistics and has been working in high-dimensional random matrices for the last fifteen years. He has been the Editor of Sankyhā for several years and has been on the editorial board of several other journals. He is a Fellow of the Institute of Mathematical Statistics, USA and all three national science academies of India, as well as the recipient of the S.S. Bhatnagar Award and the C.R. Rao Award. His forthcoming books are the monograph, Large Covariance and Autocovariance Matrices (with Monika Bhattacharjee), to be published by Chapman & Hall/CRC Press, and a graduate text, U-statistics, M-estimates and Resampling (with Snigdhansu Chatterjee), to be published by Hindustan Book Agency.

Methods for estimating sparse and large covariance matrices Covariance and correlation matrices play fundamental roles in every aspect of the analysis of multivariate data collected from a variety of fields including business and economics, health care, engineering, and environmental and physical sciences. High-Dimensional Covariance Estimation provides accessible and comprehensive coverage of the classical and modern approaches for estimating covariance matrices as well as their applications to the rapidly developing areas lying at the intersection of statistics and machine learning. Recently, the classical sample covariance methodologies have been modified and improved upon to meet the needs of statisticians and researchers dealing with large correlated datasets. High-Dimensional Covariance Estimation focuses on the methodologies based on shrinkage, thresholding, and penalized likelihood with applications to Gaussian graphical models, prediction, and mean-variance portfolio management. The book relies heavily on regression-based ideas and interpretations to connect and unify many existing methods and algorithms for the task. High-Dimensional Covariance Estimation features chapters on: Data, Sparsity, and Regularization Regularizing the Eigenstructure Banding, Tapering, and Thresholding Covariance Matrices Sparse Gaussian Graphical Models Multivariate Regression The book is an ideal resource for researchers in statistics, mathematics, business and economics, computer sciences, and engineering, as well as a useful text or supplement for graduate-level courses in multivariate analysis, covariance estimation, statistical learning, and high-dimensional data analysis.

This is an introductory book on Non-Commutative Probability or Free Probability and Large Dimensional Random Matrices. Basic concepts of free probability are introduced by analogy with classical probability in a lucid and quick manner. It then develops the results on the convergence of large dimensional random matrices, with a special focus on the interesting connections to free probability. The book assumes almost no prerequisite for the most part. However, familiarity with the basic convergence concepts in probability and a bit of mathematical maturity will be helpful. Combinatorial properties of non-crossing partitions, including the Möbius function play a central role in introducing free probability. Free independence is defined via free cumulants in analogy with the way classical independence can be defined via classical cumulants. Free cumulants are introduced through the Möbius function. Free product probability spaces are constructed using free cumulants. Marginal and joint tracial convergence of large dimensional random matrices such as the Wigner, elliptic, sample covariance, cross-covariance, Toeplitz, Circulant and Hankel are discussed. Convergence of the empirical spectral distribution is discussed for symmetric matrices. Asymptotic freeness results for random matrices, including some recent ones, are discussed in detail. These clarify the structure of the limits for joint convergence of random matrices. Asymptotic freeness of independent sample covariance matrices is also demonstrated via embedding into Wigner matrices. Exercises, at advanced undergraduate and graduate level, are provided in each chapter.

A general framework for learning sparse graphical models with conditional independence tests Complete treatments for different types of data, Gaussian, Poisson, multinomial, and mixed data Unified treatments for data integration, network comparison, and covariate adjustment Unified treatments for missing data and heterogeneous data Efficient methods for joint estimation of multiple graphical models Effective methods of high-dimensional variable selection Effective methods of high-dimensional inference

Praise for the first edition: "[This book] succeeds singularly at providing a structured introduction to this active field of research. ... it is arguably the most accessible overview yet published of the mathematical ideas and principles that one needs to master to enter the field of high-dimensional statistics. ... recommended to anyone interested in the main results of current research in high-dimensional statistics as well as anyone interested in acquiring the core mathematical skills to enter this area of research." —Journal of the American Statistical Association Introduction to High-Dimensional Statistics, Second Edition preserves the philosophy of the first edition: to be a concise guide for students and researchers discovering the area and interested in the mathematics involved. The main concepts and ideas are presented in simple settings, avoiding thereby unessential technicalities. High-dimensional statistics is a fast-evolving field, and much progress has been made on a large variety of topics, providing new insights and methods. Offering a succinct presentation of the mathematical foundations of high-dimensional statistics, this new edition: Offers revised chapters from the previous edition, with the inclusion of many additional materials on some important topics, including compress sensing, estimation with convex constraints, the slope estimator, simultaneously low-rank and row-sparse linear regression, or aggregation of a continuous set of estimators. Introduces three new chapters on iterative algorithms, clustering, and minimax lower bounds. Provides enhanced appendices, minimax lower-bounds mainly with the addition of the Davis-Kahan perturbation bound and of two simple versions of the Hanson-Wright concentration inequality. Covers cutting-edge statistical methods including model selection, sparsity and the Lasso, iterative hard thresholding, aggregation, support vector machines, and learning theory. Provides detailed exercises at the end of every chapter with collaborative solutions on a wiki site. Illustrates concepts with simple but clear practical examples.

This is an introductory text on a broad class of statistical estimators that are minimizers of convex functions. It covers the basics of U-statistics and Mm-estimators and develops their asymptotic properties. It also provides an elementary introduction to resampling, particularly in the context of these estimators. The last chapter is on practical implementation of the methods presented in other chapters, using the free software R.