The full rank condition for sparse random matrices

DOI10.1017/S096354832400021XMaRDI QIDQ6883600zbMATH OpenFDO

Authors Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth, Joon Lee, Noela Müller, Maurice Rolvien

Publication date 16 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S096354832400021X

zbMATH Keywords

finite fieldsfull ranksparse random matrix

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)

Cites work

• A multivariate Berry-Esseen theorem with explicit constants
• An elementary proof of the local central limit theorem
• Approximating CSPs with global cardinality constraints using SDP hierarchies
• Belief propagation on the random \(k\)-SAT model
• Catching the \(k\)-NAESAT threshold
• scientific article; zbMATH DE number 5532102 (Why is no real title available?)
• scientific article; zbMATH DE number 6803211 (Why is no real title available?)
• scientific article; zbMATH DE number 3245540 (Why is no real title available?)
• scientific article; zbMATH DE number 3288272 (Why is no real title available?)
• scientific article; zbMATH DE number 3320050 (Why is no real title available?)
• Information, Physics, and Computation
• Information-theoretic thresholds from the cavity method
• Invertibility of adjacency matrices for random d-regular graphs
• Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms
• Modern Coding Theory
• On behaviour of automata in labyrinths
• On the number of cycles in a random non-equiprobable graph
• On the Probability That a Random ± 1-Matrix Is Singular
• On the rank of a random binary matrix
• On the rank of random sparse matrices
• On the singularity probability of random Bernoulli matrices
• Proof of the satisfiability conjecture for large k
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Satisfiability thresholds beyond k-XORSAT
• Singularity of random Bernoulli matrices
• Singularity of the \(k\)-core of a random graph
• The probability that a random multigraph is simple
• The rank of diluted random graphs
• The rank of random graphs
• The rank of sparse random matrices
• The rank of sparse random matrices over finite fields
• The rate of regular ldpc codes
• The satisfiability threshold for random linear equations
• The set of solutions of random XORSAT formulae
• The solution space geometry of random linear equations
• Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
• Two solutions to diluted p-spin models and XORSAT problems

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

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