On the Singularity of Random Combinatorial Matrices

DOI10.1137/110853157zbMath1314.60029arXiv1112.0753OpenAlexW1964286694MaRDI QIDQ5300505

Hoi H. Nguyen

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0753

zbMATH Keywords

Bernoulli random variablessingularity probabilitynon-singular matrixLittlewood-Offord estimaterandom combinatorial matrix

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (9)

Singularity of sparse random matrices: simple proofs ⋮ Singularity of discrete random matrices ⋮ Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ On sparse random combinatorial matrices ⋮ On the singularity of adjacency matrices for random regular digraphs ⋮ The rank of random regular digraphs of constant degree ⋮ Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices ⋮ On the counting problem in inverse Littlewood–Offord theory ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors

This page was built for publication: On the Singularity of Random Combinatorial Matrices