Recent progress in combinatorial random matrix theory
Author:
- Van H. VuVVVan H. Vu
Open Access
- 1 January 2021
- journal article
- research article
- Published by Institute of Mathematical Statistics in Probability Surveys
- Vol. 18 (none) , 179-200
Abstract
We are going to discuss recent progress on many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.Keywords
All Related Versions
This publication has 58 references indexed in Scilit:
- Inverse Littlewood–Offord problems and the singularity of random symmetric matricesDuke Mathematical Journal, 2012
- Eigenvectors of random graphs: Nodal DomainsRandom Structures & Algorithms, 2011
- The rank of diluted random graphsThe Annals of Probability, 2011
- On the permanent of random Bernoulli matricesAdvances in Mathematics, 2009
- Local resilience of graphsRandom Structures & Algorithms, 2008
- The Littlewood–Offord problem and invertibility of random matricesAdvances in Mathematics, 2008
- The rank of random graphsRandom Structures & Algorithms, 2008
- A proof of Alon’s second eigenvalue conjecture and related problemsMemoirs of the American Mathematical Society, 2008
- Уточнение центральной предельной теоремы для случайных детерминантов1997
- Estimates for the concentration function of combinatorial number theory and probabilityPeriodica Mathematica Hungarica, 1977