Related papers: Optimal Delocalization for Generalized Wigner Matr…
The extended Weber location problem is a classical optimization problem that has inspired some new works in several machine learning scenarios recently. However, most existing algorithms may get stuck due to the singularity at the data…
Eugene Wigner's revolutionary vision predicted that the energy levels of large complex quantum systems exhibit a universal behavior: the statistics of energy gaps depend only on the basic symmetry type of the model. Simplified models of…
We compute exact asymptotic results for the probability of the occurrence of large deviations of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we…
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…
In this work we consider deterministic, symmetric matrices with heavy-tailed noise imposed on entries within a fixed distance $K$ to the diagonal. The most important example is discrete 1d random Schr\"odinger operator defined on…
We study the spectral properties of a class of random matrices where the matrix elements depend exponentially on the distance between uniformly and randomly distributed points. This model arises naturally in various physical contexts, such…
We study the asymptotic distribution of level crossings for random matrix pencils A_n+\lambda B_n in several ensembles, including complex and real i.i.d. matrices and Gaussian/Hermitian settings. We derive a representation of the normalized…
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…
We analyse the eigenvectors of the adjacency matrix of a critical Erd\H{o}s-R\'enyi graph $\mathbb G(N,d/N)$, where $d$ is of order $\log N$. We show that its spectrum splits into two phases: a delocalized phase in the middle of the…
This paper studies the problem of mapping optimization in decentralized control problems. A global optimization algorithm is proposed based on the ideas of ``deterministic annealing" - a powerful non-convex optimization framework derived…
Consider an $ N \times N$ Hermitian one-dimensional random band matrix with band width $W > N^{1 / 2 + \frak c} $ for any $ {\frak c} > 0$. In the bulk of the spectrum and in the large $ N $ limit, we obtain the following results: (i) The…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
Our goal is to efficiently compute low-dimensional latent coordinates for nodes in an input graph -- known as graph embedding -- for subsequent data processing such as clustering. Focusing on finite graphs that are interpreted as 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…
We prove that the linear statistics of the eigenvalues of a Wigner matrix converge to a universal Gaussian process on all mesoscopic spectral scales, i.e. scales larger than the typical eigenvalue spacing and smaller than the global extent…
We give an upper bound on the total variation distance between the linear eigenvalue statistic, properly scaled and centred, of a random matrix with a variance profile and the standard Gaussian random variable. The second order Poincar\'e…
The singular value decomposition is widely used to approximate data matrices with lower rank matrices. Feng and He [Ann. Appl. Stat. 3 (2009) 1634-1654] developed tests on dimensionality of the mean structure of a data matrix based on the…
We prove a Wegner estimate for alloy type models merely assuming that the single site potential is lower bounded by a characteristic function of a thick set, that is a particular set of positive measure. The proof is based on two…
This work provide a thorough study of L\'evy or heavy-tailed random matrices (LM). By analysing the self-consistent equation on the probability distribution of the diagonal elements of the resolvent we establish the equation determining the…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…