Typical kernel size and number of sparse random matrices over Galois fields: A statistical physics approach

R. C. Alamino and D. Saad
Phys. Rev. E 77, 061123 – Published 17 June 2008

Abstract

Using methods of statistical physics, we study the average number and kernel size of general sparse random matrices over Galois fields GF(q), with a given connectivity profile, in the thermodynamical limit of large matrices. We introduce a mapping of GF(q) matrices onto spin systems using the representation of the cyclic group of order q as the qth complex roots of unity. This representation facilitates the derivation of the average kernel size of random matrices using the replica approach, under the replica-symmetric ansatz, resulting in saddle point equations for general connectivity distributions. Numerical solutions are then obtained for particular cases by population dynamics. Similar techniques also allow us to obtain an expression for the exact and average numbers of random matrices for any general connectivity profile. We present numerical results for particular distributions.

  • Figure
  • Figure
  • Figure
  • Received 14 March 2008

DOI:https://doi.org/10.1103/PhysRevE.77.061123

©2008 American Physical Society

Authors & Affiliations

R. C. Alamino and D. Saad

  • Neural Computing Research Group, Aston University, Birmingham B4 7ET, United Kingdom

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 77, Iss. 6 — June 2008

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×