On the rank, kernel, and core of sparse random graphs

DOI10.1002/rsa.21227MaRDI QIDQ6641066

Margalit Glasgow, Patrick DeMichele, Alexandre Moreira

Publication date: 20 November 2024

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

zbMATH Keywords

random graphLittlewood-Offordcores of random graphsrank of random matrix

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rank of diluted random graphs
• Random symmetric matrices are almost surely nonsingular.
• Size and connectivity of the \(k\)-core of a random graph
• The tail of the hypergeometric distribution
• Sudden emergence of a giant \(k\)-core in a random graph
• Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
• Rank deficiency of random matrices
• Singularity of discrete random matrices
• Singularity of random Bernoulli matrices
• The Littlewood-Offord problem and invertibility of random matrices
• On the Rank of Random Sparse Matrices
• Hitting Time Theorems for Random Matrices
• The rank of random graphs
• The rank of sparse random matrices
• Spectral gap in random bipartite biregular graphs and applications
• Singularity of the \(k\)-core of a random graph

This page was built for publication: On the rank, kernel, and core of sparse random graphs