for complex numbers z of positive imaginary part, where the complex square root is also taken to have positive imaginary part.[2] The Stieltjes transform can be repackaged in the form of the R-transform, which is given by[3]
For the special case of correlation matrices, we know that
and . This bounds the probability mass over the interval defined by
Since this distribution describes the spectrum of random matrices with mean 0, the eigenvalues of correlation matrices that fall inside of the aforementioned interval could be considered spurious or noise. For instance, obtaining a correlation matrix of 10 stock returns calculated over a 252 trading days period would render . Thus, out of 10 eigenvalues of said correlation matrix, only the values higher than 1.43 would be considered significantly different from random.
Zhang, W.; Abreu, G.; Inamori, M.; Sanada, Y. (2011). "Spectrum sensing algorithms via finite random matrices". IEEE Transactions on Communications. 60 (1): 164–175. doi:10.1109/TCOMM.2011.112311.100721. S2CID206642535.
Share this article:
This article uses material from the Wikipedia article Marchenko–Pastur_law, and is written by contributors.
Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.