Spectral analysis of the Gram matrix of mixture models
Abstract
This text is devoted to the asymptotic study of some spectral properties of the Gram matrix built upon a collection of random vectors (the columns of ), as both the number of observations and the dimension of the observations tend to infinity and are of similar order of magnitude. The random vectors are independent observations, each of them belonging to one of classes . The observations of each class () are characterized by their distribution , where are some non negative definite matrices. The cardinality of class and the dimension of the observations are such that () and stay bounded away from and . We provide deterministic equivalents to the empirical spectral distribution of and to the matrix entries of its resolvent (as well as of the resolvent of ). These deterministic equivalents are defined thanks to the solutions of a fixed-point system. Besides, we prove that has asymptotically no eigenvalues outside the bulk of its spectrum, defined thanks to these deterministic equivalents. These results are directly used in our companion paper "Kernel spectral clustering of large dimensional data", which is devoted to the analysis of the spectral clustering algorithm in large dimensions. They also find applications in various other fields such as wireless communications where functionals of the aforementioned resolvents allow one to assess the communication performance across multi-user multi-antenna channels.
Keywords
Cite
@article{arxiv.1510.03463,
title = {Spectral analysis of the Gram matrix of mixture models},
author = {Florent Benaych-Georges and Romain Couillet},
journal= {arXiv preprint arXiv:1510.03463},
year = {2016}
}
Comments
25 pages, 1 figure. The results of this paper are directly used in our companion paper "Kernel spectral clustering of large dimensional data", which is devoted to the analysis of the spectral clustering algorithm in large dimensions. To appear in ESAIM Probab. Statist