English
Related papers

Related papers: The smallest singular value of inhomogenous random…

200 papers

We consider the problem of estimating the mean of a random vector based on $N$ independent, identically distributed observations. We prove the existence of an estimator that has a near-optimal error in all directions in which the variance…

Statistics Theory · Mathematics 2020-10-23 Gabor Lugosi , Shahar Mendelson

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Methodology · Statistics 2016-05-03 Juhee Cho , Donggyu Kim , Karl Rohe

In this manuscript we give an extension of the classic Salem--Zygmund inequality for locally sub-Gaussian random variables. As an application, the concentration of the roots of a Kac polynomial is studied, which is the main contribution of…

Probability · Mathematics 2023-05-05 Gerardo Barrera , Paulo Manrique

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

Probability · Mathematics 2020-04-08 Alexander E. Litvak , Konstantin E. Tikhomirov

We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, where singular values below a prescribed threshold $\lambda$ are set to 0. We study the asymptotic MSE in a framework where the matrix size…

Methodology · Statistics 2014-06-05 Matan Gavish , David L. Donoho

We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that…

Probability · Mathematics 2016-08-11 Afonso S. Bandeira , Ramon van Handel

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

Combinatorics · Mathematics 2020-10-20 Marcelo Campos , Letícia Mattos , Robert Morris , Natasha Morrison

Let $U$ and $V$ be two independent $N$ by $N$ random matrices that are distributed according to Haar measure on $U(N)$. Let $\Sigma$ be a non-negative deterministic $N$ by $N$ matrix. The single ring theorem [26] asserts that the empirical…

Probability · Mathematics 2019-03-04 Zhigang Bao , László Erdős , Kevin Schnelli

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

Probability · Mathematics 2020-01-28 Konstantin Tikhomirov

Let $A$ be a matrix whose columns $X_1,\dots, X_N$ are independent random vectors in $\mathbb{R}^n$. Assume that the tails of the 1-dimensional marginals decay as $\mathbb{P}(|\langle X_i, a\rangle|\geq t)\leq t^{-p}$ uniformly in $a\in…

Probability · Mathematics 2015-09-09 Olivier Guédon , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…

Data Structures and Algorithms · Computer Science 2022-07-25 Rajarshi Bhattacharjee , Gregory Dexter , Petros Drineas , Cameron Musco , Archan Ray

In this paper, we consider the singular values and singular vectors of finite, low rank perturbations of large rectangular random matrices. Specifically, we prove almost sure convergence of the extreme singular values and appropriate…

Probability · Mathematics 2012-01-27 Florent Benaych-Georges , Raj Rao Nadakuditi

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

Probability · Mathematics 2008-01-09 Laurent Bruneau , Francois Germinet

Inspired by the idea of Bernoulli decomposition, we give a simple proof for a generalization of Hal\'asz anti--concentration result about random sum of vectores in $\mathbb{R}^d$. From our results, we can give one upper bound for the…

Probability · Mathematics 2018-11-12 Paulo C. Manrique Mirón

We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…

Probability · Mathematics 2019-04-25 Phil Kopel , Sean O'Rourke , Van Vu

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…

Probability · Mathematics 2021-05-07 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…

Functional Analysis · Mathematics 2025-08-15 Zhiqiang Xu

We show that every matrix $A \in \mathbb{R}^{n\times n}$ is at least $\delta$$\|A\|$-close to a real matrix $A+E \in \mathbb{R}^{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta^{-1})$. In fact, we prove…

Functional Analysis · Mathematics 2020-05-20 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We consider the least singular value of $M = R^* X T + U^* YV$, where $R,T,U,V$ are independent Haar-distributed unitary matrices and $X, Y$ are deterministic diagonal matrices. Under weak conditions on $X$ and $Y$, we show that the…

Probability · Mathematics 2020-08-26 Ziliang Che , Patrick Lopatto

This short note presents upper bounds of the expectations of the largest singular values/eigenvalues of various types of random tensors in the non-asymptotic sense. For a standard Gaussian tensor of size $n_1\times\cdots\times n_d$, it is…

Spectral Theory · Mathematics 2021-06-22 Yuning Yang
‹ Prev 1 4 5 6 7 8 10 Next ›