On the singularity of adjacency matrices for random regular digraphs
From MaRDI portal
Publication:510262
DOI10.1007/s00440-015-0679-8zbMath1365.05260arXiv1411.0243OpenAlexW2270656976MaRDI QIDQ510262
Publication date: 17 February 2017
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0243
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Directed graphs (digraphs), tournaments (05C20)
Related Items
Singularity of sparse Bernoulli matrices ⋮ On sparse random combinatorial matrices ⋮ Circular law for sparse random regular digraphs ⋮ Singularity of the \(k\)-core of a random graph ⋮ Discrepancy properties for random regular digraphs ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Local Kesten-McKay law for random regular graphs ⋮ Quantitative invertibility of non-Hermitian random matrices ⋮ Spectrum of random d‐regular graphs up to the edge ⋮ The circular law for random regular digraphs with random edge weights ⋮ On the second eigenvalue of random bipartite biregular graphs ⋮ Edge rigidity and universality of random regular graphs of intermediate degree ⋮ Structure of eigenvectors of random regular digraphs ⋮ The spectral gap of dense random regular graphs ⋮ The smallest singular value of a shifted $d$-regular random square matrix ⋮ Size biased couplings and the spectral gap for random regular graphs ⋮ 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 ⋮ Invertibility of adjacency matrices for random \(d\)-regular graphs ⋮ On the counting problem in inverse Littlewood–Offord theory ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Around the circular law
- Random graphs with a given degree sequence
- The single ring theorem
- Sparse regular random graphs: spectral density and eigenvectors
- Limiting spectral distribution of sum of unitary and orthogonal matrices
- Lower estimates for the singular values of random matrices
- On the singularity probability of discrete random matrices
- On factors in random graphs
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of integer matrices with large equal row and column sums
- Random matrices: universality of ESDs and the circular law
- Local law for eigenvalues of random regular bipartite graphs
- Stein's method for concentration inequalities
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Circular law theorem for random Markov matrices
- Circular law for random discrete matrices of given row sum
- Random doubly stochastic matrices: the circular law
- The Littlewood-Offord problem and invertibility of random matrices
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- The Marčenko-Pastur law for sparse random bipartite biregular graphs
- Circular law for random matrices with exchangeable entries
- Smooth analysis of the condition number and the least singular value
- On the singularity probability of random Bernoulli matrices
- On the Probability That a Random ± 1-Matrix Is Singular
- Sparse random graphs: Eigenvalues and eigenvectors
- Circular law for random matrices with unconditional log-concave distribution
- On the Singularity of Random Combinatorial Matrices
- Invertibility of random matrices: Unitary and orthogonal perturbations
- On a lemma of Littlewood and Offord
