Related papers: Real symmetric random matrices and paths counting

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…

We study two types of random matrix ensembles that emerge when considering the same probability measure on partitions. One is the Meixner ensemble with a hard wall and the other are two families of unitary matrix models, with weight…

Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be, for example, a rating matrix in recommendation system.…

Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…

We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…

Series representations consisting of spherical harmonics are obtained for characteristic exponents and probability density functions of multivariate stable distributions under various conditions. A esult potentially applicable in a…

Some randomized algorithms, used to obtain a random $n^2 \times n^2$ Sudoku matrix, where $n$ is a natural number, is reviewed in this study. Below is described the set $\Pi_n$ of all $(2n) \times n$ matrices, consisting of elements of the…

We develop a procedure for determining whether a square complex matrix is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. Our approach has several advantages over existing methods. We discuss these differences and…

The paper is concerned with the correlation functions of the characteristic polynomials of random matrices with independent complex entries. We investigate how the asymptotic behavior of the correlation functions depends on the second…

Spectral sampling is associated with the group of unitary transformations acting on matrices in much the same way that simple random sampling is associated with the symmetric group acting on vectors. This parallel extends to symmetric…

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

We consider a generalization of the Ewens measure for the symmetric group, calculating moments of the characteristic polynomial and similar multiplicative statistics. In addition, we study the asymptotic behavior of linear statistics (such…

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

Let A be a real symmetric matrix of size N such that the number of the non-zero entries in each row is polylogarithmic in N and the positions and the values of these entries are specified by an efficiently computable function. We consider…

Consider the ensemble of real symmetric Toeplitz matrices whose entries are i.i.d random variables chosen from a fixed probability distribution p of mean 0, variance 1 and finite higher moments. Previous work [BDJ,HM] showed that the…

We consider n-by-n matrices whose (i, j)-th entry is f(X_i^T X_j), where X_1, ...,X_n are i.i.d. standard Gaussian random vectors in R^p, and f is a real-valued function. The eigenvalue distribution of these random kernel matrices is…

Suppose $X$ and $Y$ are $p\times n$ matrices each with mean $0$, variance $1$ and where all moments of any order are uniformly bounded as $p,n \to \infty$. Moreover, the entries $(X_{ij}, Y_{ij})$ are independent across $i,j$ with a common…

This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors $\pm X_1,...,\pm X_N\in\R^n$, ($N\ge n$). We introduce a class of random sampling matrices and show that they…

Let $S=XX^T$ be the (unscaled) sample covariance matrix where $X$ is a real $p \times n$ matrix with independent entries. It is well known that if the entries of $X$ are independent and identically distributed (i.i.d.) with enough moments…