A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices

Abstract : This paper deals with the problem of parameter estimation based on certain eigenspaces of the empirical covariance matrix of an observed multidimensional time series, in the case where the time series dimension and the observation window grow to infinity at the same pace. In the area of large random matrix theory, recent contributions studied the behavior of the extreme eigenvalues of a random matrix and their associated eigenspaces when this matrix is subject to a fixed-rank perturbation. The present work is concerned with the situation where the parameters to be estimated determine the eigenspace structure of a certain fixed-rank perturbation of the empirical covariance matrix. An estimation algorithm in the spirit of the well-known MUSIC algorithm for parameter estimation is developed. It relies on an approach recently developed by Benaych-Georges and Nadakuditi, relating the eigenspaces of extreme eigenvalues of the empirical covariance matrix with eigenspaces of the perturbation matrix. First and second order analyses of the new algorithm are performed.

Contributeur : Jamal Najim <>
Soumis le : mardi 21 août 2012 - 14:27:28
Dernière modification le : jeudi 9 février 2017 - 15:19:20
Document(s) archivé(s) le : jeudi 22 novembre 2012 - 02:20:09


Fichiers produits par l'(les) auteur(s)



Walid Hachem, Philippe Loubaton, X. Mestre, Jamal Najim, Pascal Vallet. A Subspace Estimator for Fixed Rank Perturbations of Large Random Matrices. Journal of Multivariate Analysis, Elsevier, 2013, 114, pp.427-447. <10.1016/j.jmva.2012.08.006>. <hal-00598826v2>



Consultations de
la notice


Téléchargements du document