Typical kernel size and number of sparse random matrices over GF(q) - a statistical physics approach

Physics – Condensed Matter – Other Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 3 figures

Scientific paper

10.1103/PhysRevE.77.061123

Using methods of statistical physics, we study the average number and kernel size of general sparse random matrices over 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 q-th 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 number of random matrices for any general connectivity profile. We present numerical results for particular distributions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Typical kernel size and number of sparse random matrices over GF(q) - a statistical physics approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Typical kernel size and number of sparse random matrices over GF(q) - a statistical physics approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typical kernel size and number of sparse random matrices over GF(q) - a statistical physics approach will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-246621

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.