Related papers: Column randomization and almost-isometric embeddin…

Let $\Delta_{k;n}$ be the maximum number of common neighbors of a set of $k$ vertices in $G(n,p)$. In this paper, we find $a_n$ and $\sigma_n$ such that $\frac{\Delta_{k;n}-a_n}{\sigma_n}$ converges in distribution to a random variable…

We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of $2\times2$ nonnegative matrices,…

We study the approximation of expectations $\E(f(X))$ for Gaussian random elements $X$ with values in a separable Hilbert space $H$ and Lipschitz continuous functionals $f \colon H \to \R$. We consider restricted Monte Carlo algorithms,…

The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…

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…

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…

We compute exact asymptotic results for the probability of the occurrence of large deviations of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we…

Consider random k-circulants A_{k,n} with n tends to infinity, k=k(n) and whose input sequence \{a_l\}_{l \ge 0} is independent with mean zero and variance one and \sup_n n^{-1}\sum_{l=1}^n \E |a_l|^{2+\delta}< \infty for some \delta > 0.…

This paper expands the analysis of randomized low-rank approximation beyond the Gaussian distribution to four classes of random matrices: (1) independent sub-Gaussian entries, (2) independent sub-Gaussian columns, (3) independent bounded…

A probability distribution over {-1, 1}^n is (eps, k)-wise uniform if, roughly, it is eps-close to the uniform distribution when restricted to any k coordinates. We consider the problem of how far an (eps, k)-wise uniform distribution can…

We present a new approach, inspired by Stein's method, to prove a central limit theorem (CLT) for linear statistics of $\beta$-ensembles in the one-cut regime. Compared with the previous proofs, our result requires less regularity on the…

Let $X,X_1,X_2,\ldots$ be i.i.d. ${\mathbb{R}}^d$-valued real random vectors. Assume that ${\mathbf{E}X=0}$, $\operatorname {cov}X=\mathbb{C}$, $\mathbf{E}\Vert X\Vert^2=\sigma ^2$ and that $X$ is not concentrated in a proper subspace of…

Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being i.i.d. random variables with mean zero and unit variance. We additionally suppose that $\mathbb E |X_{11}|^{4 + \delta} =:…

For $k,m,n\in \mathbb{N}$, we consider $n^k\times n^k$ random matrices of the form $$ \mathcal{M}_{n,m,k}(\mathbf{y})=\sum_{\alpha=1}^m\tau_\alpha {Y_\alpha}Y_\alpha^T,\quad…

The $\gamma_2$ norm of a real $m\times n$ matrix $A$ is the minimum number $t$ such that the column vectors of $A$ are contained in a $0$-centered ellipsoid $E\subseteq\mathbb{R}^m$ which in turn is contained in the hypercube $[-t, t]^m$.…

We show that if one selects uniformly independently and identically distributed matrices $A_1, \ldots, A_s \in \mathrm{SL}_2(\mathbb{Z})$ from a ball of large radius $X$ then with probability at least $1 - X^{-1 + o(1)}$ the matrices $A_1,…

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}$…