Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
From MaRDI portal
Publication:2032427
DOI10.1007/s00440-021-01038-4zbMath1468.05275arXiv1809.08454OpenAlexW3136792555MaRDI QIDQ2032427
Anirban Basak, M. V. Rudel'son
Publication date: 11 June 2021
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.08454
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Probabilistic methods in Banach space theory (46B09) Density (toughness, etc.) (05C42)
Related Items
Singularity of sparse random matrices: simple proofs, Singularity of discrete random matrices, Singularity of sparse Bernoulli matrices, Singularity of the \(k\)-core of a random graph, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Upper tail of the spectral radius of sparse Erdös-Rényi graphs, Quantitative invertibility of non-Hermitian random matrices, Recent progress in combinatorial random matrix theory, Tail bounds for gaps between eigenvalues of sparse random matrices, Rank deficiency of random matrices
Cites Work
- Adjacency matrices of random digraphs: singularity and anti-concentration
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Around the circular law
- Universality and the circular law for sparse random matrices
- On the singularity of adjacency matrices for random regular digraphs
- Invertibility of sparse non-Hermitian matrices
- Anisotropic local laws for random matrices
- The rank of random regular digraphs of constant degree
- Limiting spectral distribution of sum of unitary and orthogonal matrices
- The circular law for random matrices
- Spectral analysis of large dimensional random matrices
- On the singularity probability of discrete random matrices
- On subspaces spanned by random selections of \(\pm 1\) vectors
- Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries
- Fixed energy universality of Dyson Brownian motion
- The smallest singular value of a shifted $d$-regular random square matrix
- Circular law for the sum of random permutation matrices
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Random matrices: universality of ESDs and the circular law
- The circular law for random regular digraphs
- Singularity of random Bernoulli matrices
- The circular law for sparse non-Hermitian matrices
- Invertibility of random matrices: norm of the inverse
- Circular law theorem for random Markov matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Smallest singular value of random matrices and geometry of random polytopes
- Circular law for sparse random regular digraphs
- On the Rank of Random Sparse Matrices
- Hitting Time Theorems for Random Matrices
- On random ±1 matrices: Singularity and determinant
- On the singularity probability of random Bernoulli matrices
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- RANDOM MATRICES: THE CIRCULAR LAW
- The rank of random graphs
- Smallest singular value of a random rectangular matrix
- On the efficiency of algorithms of analysis
- Eigenvalues and Condition Numbers of Random Matrices
- Some estimates of norms of random matrices
- On the Probability That a Random ± 1-Matrix Is Singular
- The distribution of sandpile groups of random regular graphs
- Invertibility of random matrices: Unitary and orthogonal perturbations
- Invertibility of symmetric random matrices
- Numerical inverting of matrices of high order
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
