Properties of sparse random matrices over finite fields

DOI10.1088/1742-5468/2009/04/P04017zbMath1456.82482OpenAlexW2019009914MaRDI QIDQ3301049

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

zbMATH Keywords

networksrandom graphsrandom matrix theory and extensionsnew applications of statistical mechanics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Random matrices (algebraic aspects) (15B52)

Related Items (1)

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rank of a random matrix
• Spectra of Euclidean random matrices
• On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
• Random matrices and the replica method
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• On the top eigenvalue of heavy-tailed random matrices
• A mean field theory of coded CDMA systems
• Rank and Kernel of Binary Hadamard Codes
• The rank of sparse random matrices over finite fields
• Statistical mechanics of low-density parity-check codes
• The Theory of Information and Coding
• Statistical Physics of Spin Glasses and Information Processing
• Extreme value problems in random matrix theory and other disordered systems
• Spectral density of sparse sample covariance matrices
• Statistical mechanics analysis of LDPC coding in MIMO Gaussian channels

This page was built for publication: Properties of sparse random matrices over finite fields