Related papers: Uniform uncertainty principle for Bernoulli and su…

An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random…

This note demonstrates that it is possible to bound the expectation of an arbitrary norm of a random matrix drawn from the Stiefel manifold in terms of the expected norm of a standard Gaussian matrix with the same dimensions. A related…

We study the universality of the eigenvalue statistics of the covariance matrices $\frac{1}{n}M^* M$ where $M$ is a large $p\times n$ matrix obeying condition $\bf{C1}$. In particular, as an application, we prove a variant of universality…

We investigate the spectral properties of the product of $M$ complex non-Hermitian random matrices that are obtained by removing $L$ rows and columns of larger unitary random matrices uniformly distributed on the group ${\rm U}(N+L)$. Such…

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…

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…

An oblivious subspace embedding is a random $m\times n$ matrix $\Pi$ such that, for any $d$-dimensional subspace, with high probability $\Pi$ preserves the norms of all vectors in that subspace within a $1\pm\epsilon$ factor. In this work,…

Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega=(\omega_n)_{n\geq 1}$ uniformly distributed…

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…

Teramoto et al. defined a new measure called the gap ratio that measures the uniformity of a finite point set sampled from $\cal S$, a bounded subset of $\mathbb{R}^2$. We generalize this definition of measure over all metric spaces by…

We compare different formulations of the generalized uncertainty principle that have an underlying algebraic structure. We show that the formulation by Kempf, Mangano and Mann (KMM) [Phys. Rev. D 52 (1995)], quite popular for…

We prove the universal asymptotically almost sure non-singularity of general Ginibre and Wigner ensembles of random matrices when the distribution of the entries are independent but not necessarily identically distributed and may depend on…

Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly…

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

This paper gives a rigorous proof of a conjectured statistical self-similarity property of the eigenvalues random matrices from the Circular Unitary Ensemble. We consider on the one hand the eigenvalues of an $n \times n$ CUE matrix, and on…

Given a probability distribution in R^n with general (non-white) covariance, a classical estimator of the covariance matrix is the sample covariance matrix obtained from a sample of N independent points. What is the optimal sample size N =…

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…

Random matrix models consisting of normal matrices, defined by the sole constraint $[N^{\dag},N]=0$, will be explored. It is shown that cubic eigenvalue repulsion in the complex plane is universal with respect to the probability…

We present simple, user-friendly bounds for the expected operator norm of a random kernel matrix under general conditions on the kernel function $k(\cdot,\cdot)$. Our approach uses decoupling results for U-statistics and the non-commutative…