Related papers: The spectrum of coupled random matrices
In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special…
In a mixed generalized linear model, the goal is to learn multiple signals from unlabeled observations: each sample comes from exactly one signal, but it is not known which one. We consider the prototypical problem of estimating two…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields…
We place ourselves in the setting of high-dimensional statistical inference, where the number of variables $p$ in a data set of interest is of the same order of magnitude as the number of observations $n$. More formally, we study the…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
An iterative algorithm for determining a class of solutions of the dispersionful 2-Toda hierarchy characterized by string equations is developed. This class includes the solution which underlies the large N-limit of the Hermitian matrix…
The cross spectrum encodes the correlated variability between two time signals. In recent years, the cross spectrum has been used to study astronomical sources, particularly in the field of X-ray timing. In the literature, it has been…
In lattice QCD spectrum calculations, it is desirable to obtain multiple excited state energies in each symmetry channel. Typically, one constructs several interpolating operators for the symmetry channel of interest, forms the `correlator…
This is a tutorial on some basic non-asymptotic methods and concepts in random matrix theory. The reader will learn several tools for the analysis of the extreme singular values of random matrices with independent rows or columns. Many of…
We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the…
We consider non-interacting fermions on a lattice and give a general result for the reduced density matrices corresponding to parts of the system. This allows to calculate their spectra, which are essential in the DMRG method, by…
We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…
We find that a broken PT-symmetry operator when interacts with suitable Hermitian operator, new system becomes completely un-broken PT symmetry. Further on varying the contribution of Hermiticity one can delay or control the broken…
We consider the additive superimposition of an extensive number of independent Euclidean Random Matrices in the high-density regime. The resolvent is computed with techniques from free probability theory, as well as with the replica method…
We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and the method works in principle on any…
We illustrate a general method for calculating spectral statistics that combines the universal (Random Matrix Theory limit) and the non-universal (trace-formula-related) contributions by giving a heuristic derivation of the three-point…
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…
Since it was first applied to the study of nuclear interactions by Wigner and Dyson, almost 60 years ago, Random Matrix Theory (RMT) has developed into a field of its own within applied mathematics, and is now essential to many parts of…