English
Related papers

Related papers: Random Matrices from Linear Codes and Wigner's Sem…

200 papers

We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…

Computational Complexity · Computer Science 2015-11-25 John Kim , Swastik Kopparty

Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the…

Information Theory · Computer Science 2013-11-13 José Andrés Armario , María Dolores Frau

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

Probability · Mathematics 2011-11-10 Omer Angel , Alexander E. Holroyd , Dan Romik , Balint Virag

Our main result is a local limit law for the empirical spectral distribution of the anticommutator of independent Wigner matrices, modeled on the local semicircle law. Our approach is to adapt some techniques from one of the recent papers…

Probability · Mathematics 2013-08-29 Greg W. Anderson

We study the special case of $n\times n$ 1D Gaussian Hermitian random band matrices, when the covariance of the elements is determined by the matrix $J=(-W^2\triangle+1)^{-1}$. Assuming that $n\ge CW\log W\gg 1$, we prove that the averaged…

Mathematical Physics · Physics 2016-08-24 Mariya Shcherbina , Tatyana Shcherbina

We present a simple and versatile method for deriving (an)isotropic local laws for general random matrices constructed from independent random variables. Our method is applicable to mean-field random matrices, where all independent…

Probability · Mathematics 2017-04-13 Yukun He , Antti Knowles , Ron Rosenthal

We consider the Wigner matrix $W_{n}$ of dimension $n \times n$ as $n \to \infty$. The objective of this paper is two folds: first we construct an operator $\mathcal{W}$ on a suitable Hilbert space $\mathcal{H}$ and then define a suitable…

Probability · Mathematics 2025-06-12 Debapratim Banerjee

For a large class of symmetric random matrices with correlated entries, selected from stationary random fields of centered and square integrable variables, we show that the limiting distribution of eigenvalue counting measure always exists…

Probability · Mathematics 2016-03-08 Costel Peligrad , Magda Peligrad

Let $X$ be a matrix sampled uniformly from the set of doubly stochastic matrices of size $n\times n$. We show that the empirical spectral distribution of the normalized matrix $\sqrt{n}(X-{\mathbf {E}}X)$ converges almost surely to the…

Combinatorics · Mathematics 2014-03-28 Hoi H. Nguyen

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

Information Theory · Computer Science 2020-12-08 Pavel Pudlák

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

Information Theory · Computer Science 2012-07-06 Mahdi Cheraghchi , Venkatesan Guruswami , Ameya Velingker

In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…

Information Theory · Computer Science 2009-05-29 Alexandre Graell i Amat , Raphael Le Bidan

This paper considers '$\delta$-almost Reed-Muller codes', i.e., linear codes spanned by evaluations of all but a $\delta$ fraction of monomials of degree at most $d$. It is shown that for any $\delta > 0$ and any $\varepsilon>0$, there…

Information Theory · Computer Science 2021-10-07 Emmanuel Abbe , Jan Hązła , Ido Nachum

Understanding the limiting behavior of eigenvalues of random matrices is the central problem of random matrix theory. Classical limit results are known for many models, and there has been significant recent progress in obtaining more…

Probability · Mathematics 2017-09-05 Elizabeth S. Meckes , Mark W. Meckes

Consider an $N\times N$ hermitian random matrix with independent entries, not necessarily Gaussian, a so called Wigner matrix. It has been conjectured that the local spacing distribution, i.e. the distribution of the distance between…

Mathematical Physics · Physics 2009-10-31 Kurt Johansson

We prove the existence of the limiting spectral distribution (LSD) of symmetric triangular patterned matrices and also establish the joint convergence of sequences of such matrices. For the particular case of the symmetric triangular Wigner…

Probability · Mathematics 2012-04-12 Riddhipratim Basu , Arup Bose , Shirshendu Ganguly , Rajat Subhra Hazra

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

Combinatorics · Mathematics 2020-03-06 Mustafa Gezek , Rudi Mathon , Vladimir D. Tonchev

Schierenberg et al. [Phys. Rev. E 85, 061130 (2012)] recently applied the Wigner surmise, i.e., substitution of \infty \times \infty matrices by their 2 \times 2 counterparts for the computation of level spacing distributions, to random…

Mathematical Physics · Physics 2015-06-11 Shinsuke M. Nishigaki
‹ Prev 1 3 4 5 6 7 10 Next ›