The rank of random graphs

DOI10.1002/rsa.20219zbMath1194.05083arXivmath/0606414MaRDI QIDQ3608296

Kevin P. Costello, Van H. Vu

Publication date: 4 March 2009

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0606414

zbMATH Keywords

random matrix; random graph; Littlewood-Offord

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Singularity of sparse random matrices: simple proofs, Spectral gap in random bipartite biregular graphs and applications, The rank of sparse random matrices, Singularity of the \(k\)-core of a random graph, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube, The rank of diluted random graphs, The rank of random regular digraphs of constant degree, 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, Recent progress in combinatorial random matrix theory, Invertibility of adjacency matrices for random \(d\)-regular graphs, Rank deficiency of random matrices, Conformally covariant operators and conformal invariants on weighted graphs, On the universality of the non-singularity of general Ginibre and Wigner random matrices, On the Rank of Random Sparse Matrices, Hitting Time Theorems for Random Matrices

Cites Work

• Random symmetric matrices are almost surely nonsingular.
• On the Rank of Random Sparse Matrices
• On random ±1 matrices: Singularity and determinant
• On the singularity probability of random Bernoulli matrices
• On the Probability That a Random ± 1-Matrix Is Singular