Symmetric Pseudo-Random Matrices

@article{Soloveychik2018SymmetricPM,
  title={Symmetric Pseudo-Random Matrices},
  author={Ilya Soloveychik and Yu Xiang and Vahid Tarokh},
  journal={IEEE Transactions on Information Theory},
  year={2018},
  volume={64},
  pages={3179-3196}
}
We consider the problem of generating symmetric pseudo-random sign (±1) matrices based on the similarity of their spectra to Wigner’s semicircular law. Using binary <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula>-sequences (Golomb sequences) of lengths <inline-formula> <tex-math notation="LaTeX">$n=2^{m}-1$ </tex-math></inline-formula>, we give a simple explicit construction of circulant <inline-formula> <tex-math notation="LaTeX">$n \times n$ </tex-math></inline… 

Figures from this paper

Explicit symmetric pseudo-random matrices
TLDR
Using binary m-sequences (Golomb sequences) of lengths n, a simple explicit construction of circulant n × n sign matrices is given and it is shown that their spectra converge to the semicircular law when n grows.
RANDOM MATRICES FROM LINEAR CODES AND THE CONVERGENCE TO WIGNER ’ S SEMICIRCLE LAW
TLDR
It is shown that the dual distance being at least 5 is sufficient to ensure the convergence, and the convergence rate is of the form n−β for some 0 < β < 1, where n is the length of the code.
Random Matrices From Linear Codes and Wigner’s Semicircle Law
In this paper, we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions
Random Matrices from Linear Codes and Wigner’s Semicircle Law II
  • Chin Hei Chan, Maosheng Xiong
  • Computer Science
    2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)
  • 2019
TLDR
By employing more advanced techniques related to Stieltjes transform, it is shown that the dual distance being at least 5 is sufficient to ensure the convergence and a fast convergence rate in terms of the length of the code is obtained.
Asymptotically Pseudo-Independent Matrices
We show that the family of pseudo-random matrices recently discovered by Soloveychik, Xiang, and Tarokh in their work `Symmetric Pseudo-Random Matrices' exhibits asymptotic independence. More
Spectral distribution of random matrices from Mutually Unbiased Bases.
We consider the random matrix obtained by picking vectors randomly from a large collection of mutually unbiased bases of $\mathbb{C}^n$, and prove that the spectral distribution converges to the
On the Complete Weight Distribution of Subfield Subcodes of Algebraic-Geometric Codes
TLDR
A large family of subfield subcodes of algebraic-geometric codes over prime fields which include BCH codes and Goppa codes are considered and it is proved that the complete weight distribution is close to that of a random code if the code length is large compared with the genus of the curve and the degree of the divisor defining the code.
Kesten–McKay Law for Random Subensembles of Paley Equiangular Tight Frames
TLDR
The method of moments is applied to prove a recent conjecture of Haikin, Zamir and Gavish concerning the distribution of the singular values of random subensembles of Paley equiangular tight frames to prove that this conjecture is true.

References

SHOWING 1-10 OF 69 REFERENCES
Pseudo-Wigner Matrices
TLDR
The notion of an pseudo-Wigner matrix ensemble is introduced and the closeness of the spectra of its matrices to the semicircular density in the Kolmogorov distance is proved.
Semicircle Law for a Class of Random Matrices with Dependent Entries
In this paper we study ensembles of random symmetric matrices $\X_n = {X_{ij}}_{i,j = 1}^n$ with dependent entries such that $\E X_{ij} = 0$, $\E X_{ij}^2 = \sigma_{ij}^2$, where $\sigma_{ij}$ may be
Semicircle law and freeness for random matrices with symmetries or correlations
For a class of random matrix ensembles with corre- lated matrix elements, it is shown that the density of states is given by the Wigner semi-circle law. This is applied to effective Hamiltonians
Universality of covariance matrices
In this paper we prove the universality of covariance matrices of the form $H_{N\times N}={X}^{\dagger}X$ where $X$ is an ${M\times N}$ rectangular matrix with independent real valued entries
Wigner theorems for random matrices with dependent entries: Ensembles associated to symmetric spaces and sample covariance matrices
It is a classical result of Wigner that for an hermitian matrix with independent entries on and above the diagonal, the mean empirical eigenvalue distribution converges weakly to the semicircle law
Algebraic coding theory
  • E. Berlekamp
  • Computer Science
    McGraw-Hill series in systems science
  • 1968
This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering
Universality of Wigner random matrices: a survey of recent results
This is a study of the universality of spectral statistics for large random matrices. Considered are symmetric, Hermitian, or quaternion self-dual random matrices with independent identically
A table of primitive binary polynomials
For those n < 5000, for which the factorization of 2n− 1 is known, the first primitive trinomial (if such exists) and a randomly generated primitive 5– and 7–nomial of degree n in GF(2) are given. A
DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
In this paper we study the distribution of eigenvalues for two sets of random Hermitian matrices and one set of random unitary matrices. The statement of the problem as well as its method of
Spectral Analysis of Large Dimensional Random Matrices
Wigner Matrices and Semicircular Law.- Sample Covariance Matrices and the Mar#x010D enko-Pastur Law.- Product of Two Random Matrices.- Limits of Extreme Eigenvalues.- Spectrum Separation.-
...
1
2
3
4
5
...