
Random matrix theory deals with the study of matrix-valued random variables. It is conventionally considered that random matrix theory dates back to the work of Wishart in 1928 [1] on the properties of matrices of the type XX † with X ε ℂ N×n a random matrix with independent Gaussian entries with zero mean and equal variance. Wishart and his followers were primarily interested in the joint distribution of the entries of such matrices and then on their eigenvalues distribution. It then dawned to mathematicians that, as the matrix dimensions N and n grow large with ratio converging to a positive value, its eigenvalue distribution converges weakly and almost surely to some deterministic distribution, which is somewhat similar to a law of large numbers for random matrices. This triggered a growing interest in particular among the signal processing community, as it is usually difficult to deal efficiently with large dimensional data because of the so-called curse of dimensionality. Other fields of research have been interested in large dimensional random matrices, among which the field of wireless communications, as the eigenvalue distribution of some random matrices is often a sufficient statistics for the performance evaluation of multidimensional wireless communication systems. © 2011 by Taylor and Francis Group, LLC.
Signal processing, Curse of dimensionality, Eigenvalues and eigenfunctions, Wireless communication system, Wireless communications, Eigenvalues distribution, Performance evaluations, Law of large numbers, Matrix algebra, Eigenvalue distributions, Sufficient statistics, Wireless telecommunication systems, Random variables, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Signal processing, Curse of dimensionality, Eigenvalues and eigenfunctions, Wireless communication system, Wireless communications, Eigenvalues distribution, Performance evaluations, Law of large numbers, Matrix algebra, Eigenvalue distributions, Sufficient statistics, Wireless telecommunication systems, Random variables, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
