The rank of sparse random matrices

DOI10.1137/1.9781611975994.35OpenAlexW2953074136MaRDI QIDQ5146801

Alperen Ali Ergur, Samuel Hetterich, Amin Coja-Oghlan, Pu Gao, Maurice Rolvien

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (8)

Singularity of the \(k\)-core of a random graph ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Lower bounds on the chromatic number of random graphs ⋮ Shorter hash-and-sign lattice-based signatures ⋮ Recent progress in combinatorial random matrix theory ⋮ An ensemble of high rank matrices arising from tournaments ⋮ Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs ⋮ Rank deficiency of random matrices

This page was built for publication: The rank of sparse random matrices