Related papers: Optimal multi-resolvent local laws for Wigner matr…
Consider a random matrix of the form $W_n = M_n + D_n$, where $M_n$ is a Wigner matrix and $D_n$ is a real deterministic diagonal matrix ($D_n$ is commonly referred to as an external source in the mathematical physics literature). We study…
On the one hand, we prove that almost surely, for large dimension, there is no eigenvalue of a Hermitian polynomial in independent Wigner and deterministic matrices, in any interval lying at some distance from the supports of a sequence of…
We prove that the number of iterations required to solve a random positive definite linear system with the conjugate gradient algorithm is almost deterministic for large matrices. We treat the case of Wishart matrices $W = XX^*$ where $X$…
We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
Consider an $N\times N$ hermitian random matrix with independent entries, not necessarily Gaussian, a so called Wigner matrix. It has been conjectured that the local spacing distribution, i.e. the distribution of the distance between…
We prove an optimal order delocalization estimate for the eigenvectors of general $N \times N$ non-Hermitian matrices $X$: $\| {\bf v } \|_\infty \leq C \sqrt{\frac{\log N}{N}}$ with very high probability, for any right or left eigenvector…
Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash},…
We investigate the problem of best policy identification in discounted linear Markov Decision Processes in the fixed confidence setting under a generative model. We first derive an instance-specific lower bound on the expected number of…
This contribution considers optimal control problems subject to nonlocal conservation laws -- those in which the velocity depends nonlocally (i.e., via a convolution) on the solution -- and the so-called singular limit. First, the existence…
We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…
Given an implicit $n\times n$ matrix $A$ with oracle access $x^TA x$ for any $x\in \mathbb{R}^n$, we study the query complexity of randomized algorithms for estimating the trace of the matrix. This problem has many applications in quantum…
Differential entropy and log determinant of the covariance matrix of a multivariate Gaussian distribution have many applications in coding, communications, signal processing and statistical inference. In this paper we consider in the high…
This paper investigates global and local laws for sample covariance matrices with general growth rates of dimensions. The sample size $N$ and population dimension $M$ can have the same order in logarithm, which implies that their ratio…
We consider deformed sparse random matrices of the form $H= W+ \lambda V$, where $W$ is a real symmetric sparse random matrix, $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$, and $\lambda = O(1)…
This is a continuation of our earlier paper on the universality of the eigenvalues of Wigner random matrices. The main new results of this paper are an extension of the results in that paper from the bulk of the spectrum up to the edge. In…
We study statistical properties of a class of band random matrices which naturally appears in systems of interacting particles. The local spectral density is shown to follow the Breit-Wigner distribution in both localized and delocalized…
Local decision rules are commonly understood to be more explainable, due to the local nature of the patterns involved. With numerical optimization methods such as gradient boosting, ensembles of local decision rules can gain good predictive…
It is shown that certain ensembles of random matrices with entries that vanish outside a band around the diagonal satisfy a localization condition on the resolvent which guarantees that eigenvectors have strong overlap with a vanishing…
We develop adaptive discretization algorithms for locally optimal experimental design of nonlinear prediction models. With these algorithms, we refine and improve a pertinent state-of-the-art algorithm in various respects. We establish…