Anti-concentration property for random digraphs and invertibility of their adjacency matrices

DOI10.1016/j.crma.2015.12.002zbMath1388.60039OpenAlexW2285491352MaRDI QIDQ512330

Pierre Youssef, Alexander E. Litvak, Konstantin Tikhomirov, Anna Lytova, Nicole Tomczak-Jaegermann

Publication date: 24 February 2017

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

Full work available at URL: https://doi.org/10.1016/j.crma.2015.12.002

zbMATH Keywords

independence numberrandom digraphsLittlewood-Offord-type anti-concentration

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Random matrices (algebraic aspects) (15B52)

Related Items

Spectral gap in random bipartite biregular graphs and applications, Singularity of sparse Bernoulli matrices, Adjacency matrices of random digraphs: singularity and anti-concentration, Circular law for sparse random regular digraphs, Structure of eigenvectors of random regular digraphs, The smallest singular value of a shifted $d$-regular random square matrix, The rank of random regular digraphs of constant degree

Cites Work

• Adjacency matrices of random digraphs: singularity and anti-concentration
• Random regular graphs of high degree
• Non-asymptotic theory of random matrices: extreme singular values
• A short survey of Stein's method
• From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
• Partitions and Their Representative Graphs
• On a lemma of Littlewood and Offord
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item