English
Related papers

Related papers: Optimal Delocalization for Non--Hermitian Eigenvec…

200 papers

We consider large non-Hermitian random matrices $X$ with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having…

Probability · Mathematics 2023-10-16 Giorgio Cipolloni , László Erdős , Dominik Schröder

We describe a randomized algorithm for producing a near-optimal hierarchical off-diagonal low-rank (HODLR) approximation to an $n\times n$ matrix $\mathbf{A}$, accessible only though matrix-vector products with $\mathbf{A}$ and…

Data Structures and Algorithms · Computer Science 2024-10-25 Tyler Chen , Feyza Duman Keles , Diana Halikias , Cameron Musco , Christopher Musco , David Persson

For a general class of large non-Hermitian random block matrices $\mathbf{X}$ we prove that there are no eigenvalues away from a deterministic set with very high probability. This set is obtained from the Dyson equation of the Hermitization…

Probability · Mathematics 2018-02-27 Johannes Alt , Laszlo Erdos , Torben Krüger , Yuriy Nemish

Let $X_N$ be a $N\times N$ matrix whose entries are i.i.d. complex random variables with mean zero and variance $\frac{1}{N}$. We study the asymptotic spectral distribution of the eigenvalues of the covariance matrix $X_N^*X_N$ for…

Mathematical Physics · Physics 2015-06-05 Claudio Cacciapuoti , Anna Maltsev , Benjamin Schlein

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} =:…

Probability · Mathematics 2019-03-20 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov , Dmitry Timushev

Stochastic convex optimization over an $\ell_1$-bounded domain is ubiquitous in machine learning applications such as LASSO but remains poorly understood when learning with differential privacy. We show that, up to logarithmic factors the…

Machine Learning · Computer Science 2021-03-03 Hilal Asi , Vitaly Feldman , Tomer Koren , Kunal Talwar

Let v_1,...,v_{n-1} be n-1 independent vectors in R^n (or C^n). We study x, the unit normal vector of the hyperplane spanned by the v_i. Our main finding is that x resembles a random vector chosen uniformly from the unit sphere, under some…

Probability · Mathematics 2016-04-19 Hoi H. Nguyen , Van H. Vu

We study a random band matrix $H=(H_{xy})_{x,y}$ of dimension $N\times N$ with mean-zero complex Gaussian entries, where $x,y$ belong to the discrete torus $(\mathbb{Z}/\sqrt{N}\mathbb{Z})^{2}$. The variance profile…

Probability · Mathematics 2025-03-11 Sofiia Dubova , Kevin Yang , Horng-Tzer Yau , Jun Yin

In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. Recently, [BGVKS, FOCS 2020] proved that a (non-Hermitian) matrix can be diagonalized with a randomized algorithm in $O(n^{\omega}\log^2(n/\epsilon))$…

Data Structures and Algorithms · Computer Science 2025-04-29 Aleksandros Sobczyk

Consider a real diagonal deterministic matrix $X_n$ of size $n$ with spectral measure converging to a compactly supported probability measure. We perturb this matrix by adding a random finite rank matrix, with delocalized eigenvectors. We…

Probability · Mathematics 2011-06-21 Florent Benaych-Georges , Alice Guionnet , Mylène Maïda

We consider the Rosenzweig-Porter model $H = V + \sqrt{T}\, \Phi$, where $V$ is a $N \times N$ diagonal matrix, $\Phi$ is drawn from the $N \times N$ Gaussian Orthogonal Ensemble, and $N^{-1} \ll T \ll 1$. We prove that the eigenfunctions…

Mathematical Physics · Physics 2019-03-13 Per von Soosten , Simone Warzel

We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of $1 - 1/e - \varepsilon$ (for…

Data Structures and Algorithms · Computer Science 2025-09-18 Niv Buchbinder , Moran Feldman

Joint diagonalization, the process of finding a shared set of approximate eigenvectors for a collection of matrices, arises in diverse applications such as multidimensional harmonic analysis or quantum information theory. This task is…

Optimization and Control · Mathematics 2025-02-12 Erik Troedsson , Marcus Carlsson , Herwig Wendt

We consider Hermitian and symmetric random band matrices $H = (h_{xy})$ in $d \geq 1$ dimensions. The matrix entries $h_{xy}$, indexed by $x,y \in (\bZ/L\bZ)^d$, are independent, centred random variables with variances $s_{xy} = \E…

Probability · Mathematics 2015-06-05 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

We prove a local law and eigenvector delocalization for general Wigner-type matrices. Our methods allow us to get the best possible interval length and optimal eigenvector delocalization in the dense case, and the first results of such kind…

Probability · Mathematics 2019-04-12 Ioana Dumitriu , Yizhe Zhu

We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of…

Computational Complexity · Computer Science 2011-07-28 Daniel Dadush , Santosh Vempala

The dichotomy of localization versus delocalization is a historic topic central to quantum and condensed matter physics. We discover a new delocalization mechanism attributed to a residue imaginary (part of) velocity $\operatorname{Im}(v)$,…

Quantum Physics · Physics 2025-07-04 Shi-Xin Hu , Yong-Xu Fu , Yi Zhang

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being independent identically distributed random variables with mean zero and unit variance. We additionally suppose that $\mathbb E…

Probability · Mathematics 2016-12-01 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

We study the question of approximability for the inverse of the FEM stiffness matrix for (scalar) second order elliptic boundary value problems by blockwise low rank matrices such as those given by the H-matrix format. We show that…

Numerical Analysis · Mathematics 2016-05-30 Markus Faustmann , Jens Markus Melenk , Dirk Praetorius

We study large $N\times N$ power-law random band matrices $H=(H_{ij})$ with centered complex Gaussian entries, where the variances satisfy a power-law decay $\mathbb{E}|H_{ij}|^2\propto (|i-j|/W+1)^{-1-\alpha}$, for some exponent…

Probability · Mathematics 2026-04-15 Jiaqi Fan , Fan Yang , Jun Yin