On sparse random combinatorial matrices
From MaRDI portal
Publication:2166274
DOI10.1016/j.disc.2022.113017zbMath1495.60005arXiv2010.07648OpenAlexW3092780567WikidataQ114190501 ScholiaQ114190501MaRDI QIDQ2166274
Elad Aigner-Horev, Yury Person
Publication date: 24 August 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.07648
Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Random matrices (algebraic aspects) (15B52)
Related Items
Cites Work
- Adjacency matrices of random digraphs: singularity and anti-concentration
- On the singularity of adjacency matrices for random regular digraphs
- Singularity of random symmetric matrices -- simple proof
- The smallest singular value of inhomogeneous square random matrices
- Recent progress in combinatorial random matrix theory
- Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
- Singularity of discrete random matrices
- Smooth analysis of the condition number and the least singular value
- Quantitative invertibility of random matrices: a combinatorial perspective
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- RANDOM MATRICES: THE CIRCULAR LAW
- Estimates for the concentration function of combinatorial number theory and probability
- On the counting problem in inverse Littlewood–Offord theory
- On the Singularity of Random Combinatorial Matrices
- Singularity of sparse random matrices: simple proofs
- On the smoothed analysis of the smallest singular value with discrete noise
This page was built for publication: On sparse random combinatorial matrices
