Results 1 
5 of
5
On the Law of Addition of Random Matrices
 COMMUNICATIONS IN MATHEMATICAL PHYSICS
, 2000
"... Normalized eigenvalue counting measure of the sum of two Hermitian (or real symmetric) matrices An and Bn rotated independently with respect to each other by the random unitary (or orthogonal) Haar distributed matrix Un (i.e. An + U ∗ n BnUn) is studied in the limit of large matrix order n. Converg ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Normalized eigenvalue counting measure of the sum of two Hermitian (or real symmetric) matrices An and Bn rotated independently with respect to each other by the random unitary (or orthogonal) Haar distributed matrix Un (i.e. An + U ∗ n BnUn) is studied in the limit of large matrix order n. Convergence in probability to a limiting nonrandom measure is established. A functional equation for the Stieltjes transform of the limiting measure in terms of limiting eigenvalue measures of An and Bn is obtained and studied.
1 The eigenvalue distribution function
"... For an N × N matrix AN, the eigenvalue distribution function 1 (e.d.f.) F AN (x) is defined as ..."
Abstract
 Add to MetaCart
For an N × N matrix AN, the eigenvalue distribution function 1 (e.d.f.) F AN (x) is defined as
RANDOM MATRICES AND ORTHOGONAL POLYNOMIALS
, 2006
"... The central question of the theory of random matrices is to determine the asymptotic behavior of the eigenvalues of large random symmetric or Hermitian matrices. In the case of the unitary Gaussian ensemble, i.e. the space of Hermitian matrices equipped with a unitarily invariant Gaussian probabilit ..."
Abstract
 Add to MetaCart
The central question of the theory of random matrices is to determine the asymptotic behavior of the eigenvalues of large random symmetric or Hermitian matrices. In the case of the unitary Gaussian ensemble, i.e. the space of Hermitian matrices equipped with a unitarily invariant Gaussian probability, Mehta’s formulae express the eigenvalue density in terms of the ChristoffelDarboux kernel of the Hermite polynomials. In fact orthogonal polynomials are a powerful tool in this theory. We will present in this course methods in the theory of random matrices which
1Performance of mutual information inference methods under unknown interference
"... In this paper, the problem of fast pointtopoint MIMO channel mutual information estimation is addressed, in the situation where the receiver undergoes unknown colored interference, whereas the channel with the transmitter is perfectly known. The considered scenario assumes that the estimation is b ..."
Abstract
 Add to MetaCart
In this paper, the problem of fast pointtopoint MIMO channel mutual information estimation is addressed, in the situation where the receiver undergoes unknown colored interference, whereas the channel with the transmitter is perfectly known. The considered scenario assumes that the estimation is based on a few channel use observations during a short sensing period. Using large dimensional random matrix theory, an estimator referred to as Gestimator is derived. This estimator is proved to be consistent as the number of antennas and observations grow large and its asymptotic performance is analyzed. In particular, the Gestimator satisfies a central limit theorem with asymptotic Gaussian fluctuations. Simulations are provided which strongly support the theoretical results, even for small system dimensions. I.