Related papers: Rank deficiency of random matrices
We provide a number of algorithmic results for the following family of problems: For a given binary m\times n matrix A and integer k, decide whether there is a "simple" binary matrix B which differs from A in at most k entries. For an…
The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…
For the Gaussian and Laguerre random matrix ensembles, the probability density function (p.d.f.) for the linear statistic $\sum_{j=1}^N (x_j - <x>)$ is computed exactly and shown to satisfy a central limit theorem as $N \to \infty$. For the…
Let $W_n= \frac{1}{\sqrt n} M_n$ be a Wigner matrix whose entries have vanishing third moment, normalized so that the spectrum is concentrated in the interval $[-2,2]$. We prove a concentration bound for $N_I = N_I(W_n)$, the number of…
In this paper we take a probabilistic look at Maclaurin's inequality, which is a refinement of the classical AM-GM inequality. In a natural randomized setting, we obtain limit theorems and show that a reverse inequality holds with high…
Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…
We investigate the linear statistics of random matrices with purely imaginary Bernoulli entries of the form $H_{pq} = \overline{H}_{qp} = \pm i$, that are either independently distributed or exhibit global correlations imposed by the…
We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…
Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…
Let $O(2n+\ell)$ be the group of orthogonal matrices of size $\left(2n+\ell\right)\times \left(2n+\ell\right)$ equipped with the probability distribution given by normalized Haar measure. We study the probability \begin{equation*}…
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…
We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…
We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…
We study the problem of efficiently correcting an erroneous product of two $n\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in…
Let $\mathbf{a}_{ij}$, $1\leq i\leq j\leq n$, be independent random variables and $\mathbf{a}_{ji}=\mathbf{a}_{ij}$, for all $i,j$. Suppose that every $\mathbf{a}_{ij}$ is bounded, has zero mean, and its variance is given by…
We consider a class of real random matrices with dependent entries and show that the limiting empirical spectral distribution is given by the Marchenko-Pastur law. Additionally, we establish a rate of convergence of the expected empirical…
We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…
For a positive integer $N$, we define the N-rank of a non singular integer $d\times d$ matrix $A$ to be the maximum integer $r$ such that there exists a minor of order $r$ whose determinant is not divisible by $N$. Given a positive integer…
Let $G_{m \times n}$ be an $m \times n$ real random matrix whose elements are independent and identically distributed standard normal random variables, and let $\kappa_2(G_{m \times n})$ be the 2-norm condition number of $G_{m \times n}$.…
We investigate uniform random block lower bidiagonal matrices over the finite field $\mathbb{F}_q$, and prove that their rank undergoes a phase transition. First, we consider block lower bidiagonal matrices with $(k_n+1)\times k_n$ blocks…