Properties of sparse random matrices over finite fields
DOI10.1088/1742-5468/2009/04/P04017zbMATH Open1456.82482OpenAlexW2019009914MaRDI QIDQ3301049FDOQ3301049
Authors: Roberto C. Alamino, David Saad 
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1742-5468/2009/04/p04017
Recommendations
- The rank of sparse random matrices over finite fields
- Random matrix theory over finite fields
- Some new results in random matrices over finite fields
- On sparse random combinatorial matrices
- A numerical study of sparse random matrices
- Good random matrices over finite fields
- scientific article; zbMATH DE number 3294050
- On the rank of random sparse matrices
- Spectra of sparse random matrices
Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Combinatorial probability (60C05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random matrices and the replica method
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- Title not available (Why is that?)
- Spectral density of sparse sample covariance matrices
- Statistical Physics of Spin Glasses and Information Processing
- The Theory of Information and Coding
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- The rank of a random matrix
- Title not available (Why is that?)
- Rank and Kernel of Binary Hadamard Codes
- On the top eigenvalue of heavy-tailed random matrices
- The rank of sparse random matrices over finite fields
- Extreme value problems in random matrix theory and other disordered systems
- Statistical mechanics of low-density parity-check codes
- Spectra of Euclidean random matrices
- Statistical mechanics analysis of LDPC coding in MIMO Gaussian channels
- A mean field theory of coded CDMA systems
Cited In (6)
- Random Krylov Spaces over Finite Fields
- Good random matrices over finite fields
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
- The rank of sparse random matrices over finite fields
- On sparse random combinatorial matrices
- On the properties of the ergodic matrices over finite fields
This page was built for publication: Properties of sparse random matrices over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301049)
