Related papers: Surjectivity of near square random matrices

Let $A=(a_{ij})$ be an $n\times n$ random matrix with i.i.d. entries such that $\mathbb{E} a_{11} = 0$ and $\mathbb{E} {a_{11}}^2 = 1$. We prove that for any $\delta>0$ there is $L>0$ depending only on $\delta$, and a subset $\mathcal{N}$…

We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…

Extending the classical Dirichlet's density theorem on coprime pairs, in this paper we describe completely the probability distribution of the number of coprime pairs in random squares of fixed side length in the lattice $\mathbb{N}^2$. The…

We consider Hermite-Pad\'e approximants in the framework of discrete integrable systems defined on the lattice $\mathbb{Z}^2$. We show that the concept of multiple orthogonality is intimately related to the Lax representations for the…

This note presents several conditions to characterize real matrix similarity between a Hurwitz matrix (and then more generally, a real square matrix) and a diagonal dominant matrix.

Let $M_n = (\xi_{ij})_{1 \leq i,j \leq n}$ be a real symmetric random matrix in which the upper-triangular entries $\xi_{ij}, i<j$ and diagonal entries $\xi_{ii}$ are independent. We show that with probability tending to 1, $M_n$ has no…

This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…

Let $\mathbf{A}$ be an $n\times n$-matrix over $\mathbb{F}_2$ whose every entry equals $1$ with probability $d/n$ independently for a fixed $d>0$. Draw a vector $\mathbf{y}$ randomly from the column space of $\mathbf{A}$. It is a simple…

A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…

We investigate the noise sensitivity of the top eigenvector of a sparse random symmetric matrix. Let $v$ be the top eigenvector of an $N\times N$ sparse random symmetric matrix with an average of $d$ non-zero centered entries per row. We…

This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…

Motivated by the popularity of stochastic rounding in the context of machine learning and the training of large-scale deep neural network models, we consider stochastic nearness rounding of real matrices $\mathbf{A}$ with many more rows…

This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…

We give rates of convergence in the almost sure invariance principle for sums of dependent random variables with semi exponential tails, whose coupling coefficients decrease at a subexponential rate. We show that the rates in the strong…

Let $R=\mathcal{O}_{\Q(\sqrt{d})}$ for $d<0$, squarefree, $d\neq -1,-3$. We prove Lehmer's conjecture for associated reciprocal polynomials of $R$-matrices; that is, any noncyclotomic $R$-matrix has Mahler measure at least…

A novel kind of self-referential square matrix is introduced. A certain subset of the matrix entries record the frequencies of occurrence of each distinct number appearing within the entire matrix. Such squares are necessarily elusive. Our…

The use of sparse precision (inverse covariance) matrices has become popular because they allow for efficient algorithms for joint inference in high-dimensional models. Many applications require the computation of certain elements of the…

Random matrix theory has played a major role in several areas of pure and applied mathematics, as well as statistics, physics, and computer science. This lecture aims to describe the intrinsic freeness phenomenon and how it provides new…

This paper presents an interesting property of the matrices that may be obtained with the use of direct Trefftz method. It is proved analytically for 2D Laplace problem that values of the elements of matrices describing the capacitance of…

The partial pivoted Cholesky approximation accurately represents matrices that are close to being low-rank. Meanwhile, the Vecchia approximation accurately represents matrices with inverse Cholesky factors that are close to being sparse.…