Singularity of sparse random matrices: simple proofs

DOI10.1017/S0963548321000146MaRDI QIDQ5886304zbMATH OpenOpenAlexWikidataFDO

Authors Asaf Ferber, Matthew Kwan, Lisa Sauermann

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Bernoulli modelcombinatorial modelrandom matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)

Recommendations

• On the singularity of random combinatorial matrices
• Singularity of sparse Bernoulli matrices
• On sparse random combinatorial matrices
• Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
• scientific article; zbMATH DE number 1436005

Cites work

• Adjacency matrices of random digraphs: singularity and anti-concentration
• Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
• Hitting Time Theorems for Random Matrices
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3245540 (Why is no real title available?)
• scientific article; zbMATH DE number 3359487 (Why is no real title available?)
• On a lemma of Littlewood and Offord
• On sparse random combinatorial matrices
• On the counting problem in inverse Littlewood-Offord theory
• On the rank of random sparse matrices
• On the singularity of random combinatorial matrices
• On the singularity of random symmetric matrices
• Random integral matrices: universality of surjectivity and the cokernel
• Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
• Singularity of discrete random matrices
• Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
• Singularity of random symmetric matrices -- simple proof
• The distribution of sandpile groups of random regular graphs
• The Littlewood-Offord problem and invertibility of random matrices
• The rank of random graphs

Cited in

(11)

• Sparse random matrices have simple spectrum
• Recent progress in combinatorial random matrix theory
• Singularity of discrete random matrices
• On sparse random combinatorial matrices
• Universality of the least singular value for sparse random matrices
• A note on some upper bounds for permanents of (0, 1)-matrices
• On the singularity of random combinatorial matrices
• Singularity of the \(k\)-core of a random graph
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Friendly bisections of random graphs
• An upper bound on the smallest singular value of dense random combinatorial matrices

This page was built for publication: Singularity of sparse random matrices: simple proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886304)