Related papers: Rescaling Ward identities in the random normal mat…
We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited…
Consider $N\times N$ symmetric one-dimensional random band matrices with general distribution of the entries and band width $W \geq N^{3/4+\varepsilon}$ for any $\varepsilon>0$. In the bulk of the spectrum and in the large $N$ limit, we…
Given a random matrix A with eigenvalues between -1 and 1, we analyze the number of iterations needed to solve the linear equation (I-A)x=b with the Neumann series iteration. We give sufficient conditions for convergence of an upper bound…
We analyze the asymptotic fluctuations of linear eigenvalue statistics of random centrosymmetric matrices with i.i.d. entries. We prove that for a complex analytic test function, the centered and normalized linear eigenvalue statistics of…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
It has been observed that the statistical distribution of the eigenvalues of random matrices possesses universal properties, independent of the probability law of the stochastic matrix. In this article we find the correlation functions of…
We extend the method of rescaled Ward identities of Ameur-Kang-Makarov to study the distribution of eigenvalues close to a bulk singularity, i.e. a point in the interior of the droplet where the density of the classical equilibrium measure…
We develop a unified approach to universality of local scaling limits for eigenvalues of random normal matrices, or equivalently for planar Coulomb gases at inverse temperature $\beta=2$. The approach is direct in that it does not rely on…
Sample covariance matrices from multi-population typically exhibit several large spiked eigenvalues, which stem from differences between population means and are crucial for inference on the underlying data structure. This paper…
We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…
We extend a recent theory of parametric correlations in the spectrum of random matrices to study the response to an external perturbation of eigenvalues near the soft edge of the support. We demonstrate by explicit non-perturbative…
This paper is aimed at deriving the universality of the largest eigenvalue of a class of high-dimensional real or complex sample covariance matrices of the form $\mathcal{W}_N=\Sigma^{1/2}XX^*\Sigma ^{1/2}$. Here, $X=(x_{ij})_{M,N}$ is an…
In this paper we studied the double scaling limit of a random unitary matrix ensemble near a singular point where a new cut is emerging from the support of the equilibrium measure. We obtained the asymptotic of the correlation kernel by…
From benign overfitting in overparameterized models to rich power-law scalings in performance, simple ridge regression displays surprising behaviors sometimes thought to be limited to deep neural networks. This balance of phenomenological…
Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for…
In this note, we investigate upper bounds of the Neumann eigenvalue problem for the Laplacian of a bounded domain (with smooth boundary) in a given complete (not compact a priori) Riemannian manifold with Ricci bounded below . For this, we…
We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…
We develop a scaling theory and a renormalization technique in the context of the modern theory of polarization. The central idea is to use the characteristic function (also known as the polarization amplitude) in place of the free energy…
We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…