Adjacency matrices of random digraphs: singularity and anti-concentration
From MaRDI portal
Publication:313537
DOI10.1016/j.jmaa.2016.08.020zbMath1344.05126arXiv1511.00113OpenAlexW2963713505MaRDI QIDQ313537
Alexander E. Litvak, Konstantin Tikhomirov, Nicole Tomczak-Jaegermann, Anna Lytova, Pierre Youssef
Publication date: 12 September 2016
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00113
random regular graphsadjacency matricesanti-concentrationinvertibility of random matricesLittlewood-Offord theorysingular probability
Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Directed graphs (digraphs), tournaments (05C20)
Related Items
Singularity of sparse random matrices: simple proofs, Spectral gap in random bipartite biregular graphs and applications, Lower bounds for the smallest singular value of structured random matrices, Singularity of sparse Bernoulli matrices, On sparse random combinatorial matrices, Circular law for sparse random regular digraphs, The sparse circular law under minimal assumptions, Singularity of the \(k\)-core of a random graph, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Anticoncentration and Berry-Esseen bounds for random tensors, The circular law for random regular digraphs with random edge weights, On the second eigenvalue of random bipartite biregular graphs, Small Ball Probability for the Condition Number of Random Matrices, Structure of eigenvectors of random regular digraphs, Fixed energy universality of Dyson Brownian motion, The spectral gap of dense random regular graphs, The smallest singular value of a shifted $d$-regular random square matrix, Anti-concentration property for random digraphs and invertibility of their adjacency matrices, Circular law for the sum of random permutation matrices, The rank of random regular digraphs of constant degree, Sharp transition of the invertibility of the adjacency matrices of sparse random graphs, Recent progress in combinatorial random matrix theory, Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices, The circular law for random regular digraphs, Anticoncentration for subgraph statistics, Invertibility of adjacency matrices for random \(d\)-regular graphs, Random matrix products: universality and least singular values, Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- Anti-concentration property for random digraphs and invertibility of their adjacency matrices
- Bulk eigenvalue statistics for random regular graphs
- Sparse regular random graphs: spectral density and eigenvectors
- Random symmetric matrices are almost surely nonsingular.
- On the singularity probability of discrete random matrices
- The isoperimetric number of random regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The expected eigenvalue distribution of a large regular graph
- On the independence and chromatic numbers of random regular graphs
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- The Littlewood-Offord problem and invertibility of random matrices
- On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
- Random regular graphs of high degree
- Non-asymptotic theory of random matrices: extreme singular values
- Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
- On the singularity probability of random Bernoulli matrices
- Expander graphs and their applications
- A proof of Alon’s second eigenvalue conjecture and related problems
- A short survey of Stein's method
- On the Probability That a Random ± 1-Matrix Is Singular
- Sparse random graphs: Eigenvalues and eigenvectors
- Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs
- On the Singularity of Random Combinatorial Matrices
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Local Semicircle Law for Random Regular Graphs
- Invertibility of symmetric random matrices
- Partitions and Their Representative Graphs
- On a lemma of Littlewood and Offord
