Singularity of random symmetric matrices -- simple proof

DOI10.5802/CRMATH.215MaRDI QIDQ1979880zbMATH OpenOpenAlexFDO

Authors Asaf Ferber

Publication date 3 September 2021

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

singularityrandom matrices

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)

Abstract: In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $pm1$ symmetric matrix is singular.

Cites work

• Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
• Invertibility of symmetric random matrices
• Mesoscopic perturbations of large random matrices
• On the counting problem in inverse Littlewood-Offord theory
• On the singularity of random symmetric matrices
• Random symmetric matrices are almost surely nonsingular.
• Singularity of random symmetric matrices -- a combinatorial approach to improved bounds

Cited in

(9)

• Singularity of the \(k\)-core of a random graph
• Random symmetric matrices are almost surely nonsingular.
• Singularity of random symmetric matrices revisited
• Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
• On the smallest singular value of symmetric random matrices
• On the permanent of a random symmetric matrix
• Singularity of sparse random matrices: simple proofs
• On sparse random combinatorial matrices
• On subgraphs with degrees of prescribed residues in the random graph

This page was built for publication: Singularity of random symmetric matrices -- simple proof

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