Recent progress in combinatorial random matrix theory
From MaRDI portal
Publication:2039767
DOI10.1214/20-PS346MaRDI QIDQ2039767
Publication date: 5 July 2021
Published in: Probability Surveys (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02797
Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Probability theory and stochastic processes (60-XX)
Related Items (6)
On sparse random combinatorial matrices ⋮ Singularity of the \(k\)-core of a random graph ⋮ Bernoulli random matrices ⋮ Quantitative invertibility of non-Hermitian random matrices ⋮ On the permanent of a random symmetric matrix ⋮ Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adjacency matrices of random digraphs: singularity and anti-concentration
- On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- A central limit theorem for the determinant of a Wigner matrix
- On the least singular value of random symmetric matrices
- Expansion of random graphs: new proofs, new results
- On the singularity of adjacency matrices for random regular digraphs
- Random matrices: tail bounds for gaps between eigenvalues
- The rank of diluted random graphs
- The complexity of computing the permanent
- The rank of random regular digraphs of constant degree
- Eigenvectors of random matrices: A survey
- Random symmetric matrices are almost surely nonsingular.
- On a Cohen-Lenstra heuristic for Jacobians of random graphs
- On the number of integral graphs
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Graphs with integral spectrum
- Spectral analysis of large dimensional random matrices
- On the singularity probability of discrete random matrices
- Ramanujan graphs
- Eigenvalues and expanders
- Random matrices have simple spectrum
- Random matrices: probability of normality
- Fixed energy universality of Dyson Brownian motion
- The smallest singular value of a shifted $d$-regular random square matrix
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- Gaussian fluctuations of the determinant of Wigner matrices
- Singularity of random Bernoulli matrices
- Random matrices: universality of local spectral statistics of non-Hermitian matrices
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Random matrices: law of the determinant
- The Littlewood-Offord problem and invertibility of random matrices
- On the permanent of random Bernoulli matrices
- On the Rank of Random Sparse Matrices
- Hitting Time Theorems for Random Matrices
- On random ±1 matrices: Singularity and determinant
- A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
- On the singularity probability of random Bernoulli matrices
- A proof of Alon’s second eigenvalue conjecture and related problems
- The rank of random graphs
- Local resilience of graphs
- Уточнение центральной предельной теоремы для случайных детерминантов
- Estimates for the concentration function of combinatorial number theory and probability
- How Many Eigenvalues of a Random Matrix are Real?
- On the Probability That a Random ± 1-Matrix Is Singular
- Resilience of the rank of random matrices
- The distribution of sandpile groups of random regular graphs
- Size of nodal domains of the eigenvectors of a graph
- The rank of sparse random matrices
- SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
- Eigenvectors of random graphs: Nodal Domains
- The distribution of sandpile groups of random graphs
- Über ein Problem von Erdös und Moser
- Random integral matrices and the Cohen-Lenstra heuristics
- Invertibility of symmetric random matrices
- Small Ball Probability, Inverse Theorems, and Applications
- On a lemma of Littlewood and Offord
- Quasi-random graphs
This page was built for publication: Recent progress in combinatorial random matrix theory
