Related papers: Sparse Hanson-Wright Inequalities with Application…

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…

We consider random matrices of the form $H = W + \lambda V$, $\lambda\in\mathbb{R}^+$, where $W$ is a real symmetric or complex Hermitian Wigner matrix of size $N$ and $V$ is a real bounded diagonal random matrix of size $N$ with i.i.d.\…

The paper is devoted to the problem of establishing right-convergence of sparse random graphs. This concerns the convergence of the logarithm of number of homomorphisms from graphs or hyper-graphs $\G_N, N\ge 1$ to some target graph $W$.…

This paper is concerned with the numerical minimization of energy functionals in Hilbert spaces involving convex constraints coinciding with a semi-norm for a subspace. The optimization is realized by alternating minimizations of the…

Consider real symmetric, complex Hermitian Toeplitz and real symmetric Hankel band matrix models, where the bandwidth $b_{N}\ra \iy$ but $b_{N}/N \to b$, $b\in [0,1]$ as $N\to \infty$. We prove that the distributions of eigenvalues converge…

Sparsity in the eigenvectors of signal covariance matrices is exploited in this paper for compression and denoising. Dimensionality reduction (DR) and quantization modules present in many practical compression schemes such as transform…

Let $M_n$ be a class of symmetric sparse random matrices, with independent entries $M_{ij} = \delta_{ij} \xi_{ij}$ for $i \leq j$. $\delta_{ij}$ are i.i.d. Bernoulli random variables taking the value $1$ with probability $p \geq…

This paper investigates the feasibility of mapping non-local, sparse, diagonal forms of quantum Hamiltonians to local forms via eigenbasis permutations. We prove that such a mapping is not always possible, definitively refuting the…

We provide moment bounds for expressions of the type $(X^{(1)} \otimes \dots \otimes X^{(d)})^T A (X^{(1)} \otimes \dots \otimes X^{(d)})$ where $\otimes$ denotes the Kronecker product and $X^{(1)}, \dots, X^{(d)}$ are random vectors with…

Starting from concentration of measure hypotheses on $m$ random vectors $Z_1,\ldots, Z_m$, this article provides an expression of the concentration of functionals $\phi(Z_1,\ldots, Z_m)$ where the variations of $\phi$ on each variable…

Sparsity is a desirable attribute. It can lead to more efficient and more effective representations compared to the dense model. Meanwhile, learning sparse latent representations has been a challenging problem in the field of computer…

We consider concave minimization problems over non-convex sets.Optimization problems with this structure arise in sparse principal component analysis. We analyze both a gradient projection algorithm and an approximate Newton algorithm where…

These notes provide an introduction to the local semicircle law from random matrix theory, as well as some of its applications. We focus on Wigner matrices, Hermitian random matrices with independent upper-triangular entries with zero…

We present some extensions of Bernstein's concentration inequality for random matrices. This inequality has become a useful and powerful tool for many problems in statistics, signal processing and theoretical computer science. The main…

The notion of local weak convergence, or Benjamini--Schramm convergence, was introduced by Benjamini and Schramm. The local weak limit of sparse Erd\H os--R\'enyi graphs is the Galton--Watson measure with Poisson offspring almost surely.…

Suppose that we observe $y \in \mathbb{R}^n$ and $X \in \mathbb{R}^{n \times m}$ in the following errors-in-variables model: \begin{eqnarray*} y & = & X_0 \beta^* +\epsilon \\ X & = & X_0 + W, \end{eqnarray*} where $X_0$ is an $n \times m$…

Meta learning of optimal classifier error rates allows an experimenter to empirically estimate the intrinsic ability of any estimator to discriminate between two populations, circumventing the difficult problem of estimating the optimal…

We show that the mixing times of random walks on compact groups can be used to obtain concentration inequalities for the respective Haar measures. As an application, we derive a concentration inequality for the empirical distribution of…

It is a challenging task to select correlated variables in a high dimensional space. To address this challenge, the elastic net has been developed and successfully applied to many applications. Despite its great success, the elastic net…

Random hyperspherical harmonics are Gaussian Laplace eigenfunctions on the unit $d$-sphere ($d\ge 2$). We investigate the distribution of their defect i.e., the difference between the measure of positive and negative regions. Marinucci and…