中文
相关论文

相关论文: On the real Davies' conjecture

200 篇论文

We compute exact asymptotic of the statistical density of random matrices belonging to the Generalized Gaussian orthogonal, unitary and symplectic ensembles such that there no eigenvalues in the interval $[\sigma, +\infty[$. In particular,…

概率论 · 数学 2015-01-27 Mohamed Bouali

We show that for an $n\times n$ random symmetric matrix $A_n$, whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable $\xi$ with mean $0$ and variance $1$, \[\mathbb{P}[s_n(A_n) \le…

概率论 · 数学 2020-11-05 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $A$ be the adjacency matrix of a uniformly random $d$-regular digraph on $n$ vertices, and suppose that $\min(d,n-d)\geq\lambda n$. We show that for any $\kappa \geq 0$, \[\mathbb{P}[s_n(A)\leq\kappa]\leq…

概率论 · 数学 2020-08-12 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…

概率论 · 数学 2016-07-19 Agnes Backhausz , Balazs Szegedy

Consider a $n \times n$ matrix from the Gaussian Unitary Ensemble (GUE). Given a finite collection of bounded disjoint real Borel sets $(\Delta_{i,n},\ 1\leq i\leq p)$, properly rescaled, and eventually included in any neighbourhood of the…

概率论 · 数学 2008-11-07 P. Bianchi , M. Debbah , J. Najim

We prove that with high probability, every eigenvector of a random matrix is delocalized in the sense that any subset of its coordinates carries a non-negligible portion of its $\ell_2$ norm. Our results pertain to a wide class of random…

概率论 · 数学 2016-12-23 Mark Rudelson , Roman Vershynin

We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N by n matrix A with independent and identically distributed subgaussian entries, the smallest singular value…

概率论 · 数学 2016-12-23 Mark Rudelson , Roman Vershynin

In an instance of the minimum eigenvalue problem, we are given a collection of $n$ vectors $v_1,\ldots, v_n \subset {\mathbb{R}^d}$, and the goal is to pick a subset $B\subseteq [n]$ of given vectors to maximize the minimum eigenvalue of…

数据结构与算法 · 计算机科学 2024-01-26 Adam Brown , Aditi Laddha , Mohit Singh

How many samples are sufficient to guarantee that the eigenvectors and eigenvalues of the sample covariance matrix are close to those of the actual covariance matrix? For a wide family of distributions, including distributions with finite…

机器学习 · 统计学 2017-02-20 Andreas Loukas

We consider $N\times N$ non-Hermitian random matrices of the form $X+A$, where $A$ is a general deterministic matrix and $\sqrt{N}X$ consists of independent entries with zero mean, unit variance, and bounded densities. For this ensemble, we…

概率论 · 数学 2023-06-06 László Erdős , Hong Chang Ji

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

组合数学 · 数学 2022-12-20 Adrian Dumitrescu , Csaba D. Tóth

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

概率论 · 数学 2024-04-22 Mohammed Osman

We study the problem of estimating an unknown vector $\theta$ from an observation $X$ drawn according to the normal distribution with mean $\theta$ and identity covariance matrix under the knowledge that $\theta$ belongs to a known closed…

统计理论 · 数学 2017-03-03 Xi Chen , Adityanand Guntuboyina , Yuchen Zhang

Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest…

概率论 · 数学 2020-09-04 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We consider an $n\times n$ matrix of independent real Gaussian random variables and determine the asymptotic distribution of the smallest gaps between complex eigenvalues.

概率论 · 数学 2024-04-01 Patrick Lopatto , Matthew Meeker

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

离散数学 · 计算机科学 2020-11-10 Paxton Turner , Raghu Meka , Philippe Rigollet

Let $A$ be a $n \times n$ symmetric matrix with $(A_{i,j})_{i\leq j} $, independent and identically distributed according to a subgaussian distribution. We show that $$\mathbb{P}(\sigma_{\min}(A) \leq \varepsilon/\sqrt{n}) \leq C…

概率论 · 数学 2023-10-24 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

It is well known that the set of all $ n \times n $ matrices with distinct eigenvalues is a dense subset of the set of all real or complex $ n \times n $ matrices. In [Hartfiel, D. J. Dense sets of diagonalizable matrices. Proc. Amer. Math.…

泛函分析 · 数学 2020-03-31 Himadri Lal Das , M. Rajesh Kannan

In this paper, we prove that an $n\times n$ matrix $A$ with independent centered subgaussian entries satisfies \[ s_{n+1-l}(A) \le C_1t \frac{l}{\sqrt{n}} \] with probability at least $1-\exp(-C_2tl)$. This yields $s_{n-l}(A) \sim…

概率论 · 数学 2016-08-03 Feng Wei

We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $\epsilon\geq d^{-O(1)}$, there is a random…

数据结构与算法 · 计算机科学 2025-11-18 Shabarish Chenakkod , Michał Dereziński , Xiaoyu Dong