Concentration of the spectral measure of large Wishart matrices with dependent entries.
Guntuboyina, Adityanand, Leeb, Hannes (2009)
Electronic Communications in Probability [electronic only]
Similarity:
The search session has expired. Please query the service again.
Guntuboyina, Adityanand, Leeb, Hannes (2009)
Electronic Communications in Probability [electronic only]
Similarity:
Guionnet, Alice (2004)
Probability Surveys [electronic only]
Similarity:
Oraby, Tamer F. (2007)
Electronic Communications in Probability [electronic only]
Similarity:
Houdré, Christian, Xu, Hua (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Alexander E. Litvak, Omar Rivasplata (2012)
Studia Mathematica
Similarity:
We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition of uniform boundedness of the variances from below. This allows us to consider matrices with null entries or, more generally, with entries having small variances. Our results do not assume identical distribution of the entries of a random matrix and help to clarify the role of the variances...
P. Dueck, S. O'Rourke, D. Renfrew, A. Soshnikov (2011)
Banach Center Publications
Similarity:
We consider large Wigner random matrices and related ensembles of real symmetric and Hermitian random matrices. Our results are related to the local spectral properties of these ensembles.
Iványi, Antal (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Vladimirov, Igor, Thompson, Bevan (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
L. Pastur (1996)
Annales de l'I.H.P. Physique théorique
Similarity:
Hofmann-Credner, Katrin, Stolz, Michael (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Soshnikov, Alexander (2004)
Electronic Communications in Probability [electronic only]
Similarity:
Brydon Eastman, Kevin N. Vander Meulen (2016)
Special Matrices
Similarity:
The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find...