scientific article
From MaRDI portal
Publication:3509410
zbMath1154.15024arXivmath/0611321MaRDI QIDQ3509410
Publication date: 1 July 2008
Full work available at URL: https://arxiv.org/abs/math/0611321
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Probability distributions: general theory (60E05) Random matrices (algebraic aspects) (15B52) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)
Related Items
Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ Singularity of random symmetric matrices revisited ⋮ The spectral gap of random regular graphs ⋮ Local Kesten-McKay law for random regular graphs ⋮ Inverse Littlewood-Offord problems and the singularity of random symmetric matrices ⋮ On the second eigenvalue of random bipartite biregular graphs ⋮ Edge rigidity and universality of random regular graphs of intermediate degree ⋮ The distribution of sandpile groups of random regular graphs ⋮ 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 ⋮ Sparse random graphs: Eigenvalues and eigenvectors ⋮ On the singularity of adjacency matrices for random regular digraphs ⋮ Size biased couplings and the spectral gap for random regular graphs ⋮ Anti-concentration property for random digraphs and invertibility of their adjacency matrices ⋮ Estimating the number of communities by spectral methods ⋮ Resilience for the Littlewood-Offord problem ⋮ The rank of random regular digraphs of constant degree ⋮ SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS ⋮ Resilience for the Littlewood-Offord problem ⋮ Sharp transition of the invertibility of the adjacency matrices of sparse random graphs ⋮ Recent progress in combinatorial random matrix theory ⋮ The circular law for random regular digraphs ⋮ Invertibility of adjacency matrices for random \(d\)-regular graphs ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Resilience of the rank of random matrices
