Projects
Reading
People
Chat
SU\G
(đž)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
The Littlewood-Offord Problem and invertibility of random matrices
Mark Rudelson
,
Roman Vershynin
Type:
Preprint
Publication Date:
2007-03-16
Citations:
8
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
The Littlewood-Offord Problem and invertibility of random matrices
2007
Mark Rudelson
Roman Vershynin
+
PDF
Chat
The LittlewoodâOfford problem and invertibility of random matrices
2008
Mark Rudelson
Roman Vershynin
+
Quantitative invertibility of random matrices: a combinatorial perspective
2019
Vishesh Jain
+
Smoothed analysis of the least singular value without inverse Littlewood-Offord theory.
2019
Vishesh Jain
+
Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
2005
Terence Tao
Van Vu
+
On the smallest singular value of symmetric random matrices
2020
Vishesh Jain
Ashwin Sah
Mehtaab Sawhney
+
On the smallest singular value of symmetric random matrices
2020
Vishesh Jain
Ashwin Sah
Mehtaab Sawhney
+
Random Matrices: The circular Law
2007
Terence Tao
Van Vu
+
PDF
Chat
Quantitative invertibility of random matrices: a combinatorial perspective
2021
Vishesh Jain
+
PDF
Chat
RANDOM MATRICES: THE CIRCULAR LAW
2008
Terence Tao
Van Vu
+
PDF
Chat
The least singular value of a random symmetric matrix
2024
Marcelo Campos
Matthew Jenssen
Marcus Michelen
Julian Sahasrabudhe
+
Lower bounds for the smallest singular value of structured random matrices
2016
Nicholas A. Cook
+
Invertibility of symmetric random matrices
2011
Roman Vershynin
+
Invertibility of symmetric random matrices
2011
Roman Vershynin
+
The smallest singular value of random rectangular matrices with no moment assumptions on entries
2014
Konstantin Tikhomirov
+
The smallest singular value of random rectangular matrices with no moment assumptions on entries
2014
Konstantin Tikhomirov
+
PDF
Chat
Lower bounds for the smallest singular value of structured random matrices
2018
Nicholas A. Cook
+
PDF
Chat
Quantitative estimates of the singular values of random i.i.d. matrices
2024
Guozheng Dai
Zhonggen Su
Hanchao Wang
+
PDF
Chat
Inverse LittlewoodâOfford problems and the singularity of random symmetric matrices
2012
Hoi H. Nguyen
+
PDF
Chat
Smallest singular value of sparse random matrices
2012
Alexander E. Litvak
Omar Rivasplata
Works That Cite This (7)
Action
Title
Year
Authors
+
PDF
Chat
Random Discrete Matrices
2008
Van Vu
+
PDF
Chat
Almost All Integer Matrices Have No Integer Eigenvalues
2009
Greg Martin
Erick B. Wong
+
On the singularity probability of discrete random matrices
2009
Jean Bourgain
Van Vu
Philip Matchett Wood
+
Numerical Thinking in Algorithm Design and Analysis
2011
ShangâHua Teng
+
PDF
Chat
Circular law, extreme singular values and potential theory
2009
Guangming Pan
Zhou Wang
+
PDF
Chat
Circular Law for Noncentral Random Matrices
2010
Djalil ChafaĂŻ
+
Streaming, Memory-limited PCA
2013
Ioannis Mitliagkas
Constantine Caramanis
Prateek Jain
Works Cited by This (16)
Action
Title
Year
Authors
+
PDF
Chat
On the distribution of additive arithmetic functions
1975
GĂĄbor HalĂĄsz
+
None
2002
Alexander Soshnikov
+
PDF
Chat
Eigenvalues and Condition Numbers of Random Matrices
1988
Alan Edelman
+
Smallest singular value of random matrices and geometry of random polytopes
2004
A.E. Litvak
Alain Pajor
Mark Rudelson
Nicole Tomczak-Jaegermann
+
On the singularity probability of random Bernoulli matrices
2007
Terence Tao
Van Vu
+
Condition numbers of random matrices
1991
StanisĆaw J. Szarek
+
Some estimates of norms of random matrices
2004
RafaĆ LataĆa
+
On subspaces spanned by random selections of ±1 vectors
1988
Andrew Odlyzko
+
PDF
Chat
On the probability that a random ±1-matrix is singular
1995
Jeff Kahn
JĂĄnos KomlĂłs
Endre Szemerédi
+
PDF
Chat
On the limit of the largest eigenvalue of the large dimensional sample covariance matrix
1988
Yanqing Yin
Zhidong Bai
P. R. Krishnaiah