The rank of sparse random matrices

DOI10.1137/1.9781611975994.35MaRDI QIDQ5146801zbMATH OpenOpenAlexFDO

Authors Amin Coja-Oghlan, Alperen Ali Ergur, Pu Gao, Samuel Hetterich, 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)

Cited in

(20)

• Sparse random matrices have simple spectrum
• Recent progress in combinatorial random matrix theory
• An ensemble of high rank matrices arising from tournaments
• Rank deficiency of random matrices
• On sparse random combinatorial matrices
• Lower bounds on the chromatic number of random graphs
• scientific article; zbMATH DE number 5994989 (Why is no real title available?)
• Componentwise Condition Numbers of Random Sparse Matrices
• The rank of sparse random matrices over finite fields
• Probabilistic rank and matrix rigidity
• Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs
• Singularity of the \(k\)-core of a random graph
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Shorter hash-and-sign lattice-based signatures
• On the rank, kernel, and core of sparse random graphs
• Minors of matroids represented by sparse random matrices over finite fields
• A central limit theorem for the matching number of a sparse random graph
• The k-XORSAT threshold revisited (extended abstract)
• The rank of sparse symmetric matrices over arbitrary fields
• Inference and mutual information on random factor graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146801)