Related papers: Delocalization for a class of random block band ma…
The spectrum of the non-backtracking matrix plays a crucial role in determining various structural and dynamical properties of networked systems, ranging from the threshold in bond percolation and non-recurrent epidemic processes, to…
We propose a boundary regularity condition for the $M_n(\mathbb{C})$-valued subordination functions in free probability to prove the local limit theorem and delocalization of eigenvectors for polynomials in two random matrices. We prove…
Random Matrix Theory (RMT) has successfully modeled diverse systems, from energy levels of heavy nuclei to zeros of $L$-functions. Many statistics in one can be interpreted in terms of quantities of the other; for example, zeros of…
We study statistical properties of the ensemble of large $N\times N$ random matrices whose entries $ H_{ij}$ decrease in a power-law fashion $H_{ij}\sim|i-j|^{-\alpha}$. Mapping the problem onto a nonlinear $\sigma-$model with non-local…
Spectral clustering is a technique that clusters elements using the top few eigenvectors of their (possibly normalized) similarity matrix. The quality of spectral clustering is closely tied to the convergence properties of these principal…
We consider $N\times N$ Hermitian random matrices with independent identically distributed entries (Wigner matrices). The matrices are normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. Under suitable…
We provide a simple proof of dynamical delocalization, that is, time-increasing lower bounds on quantum transport for discrete, one-particle Schrodinger operators on $\ell^2 (\mathbb{Z}^d)$, provided solutions to the Schrodinger equation…
Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…
We study the normalized trace $g_n(z)=n^{-1} \mbox{tr} \, (H-zI)^{-1}$ of the resolvent of $n\times n$ real symmetric matrices $H=\big[(1+\delta_{jk})W_{jk}/\sqrt n\big]_{j,k=1}^n$ assuming that their entries are independent but not…
Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one…
Mathematical analysis of the Anderson localization has been facilitated by the use of suitable fractional moments of the Green function. Related methods permit now a readily accessible derivation of a number of physical manifestations of…
We study eigenvectors in the deformed Gaussian unitary ensemble of random matrices $H=W\tilde{H}W$, where $\tilde{H}$ is a random matrix from Gaussian unitary ensemble and $W$ is a deterministic diagonal matrix with positive entries. Using…
We review some recent techniques for dealing with non-hermitian random matrix models based on generalized Green's functions. We introduce the diagrammatic methods in the hermitian case and generalize them to the non-hermitian case. The…
Networks of random quantum scatterers (S-matrices) form paradigmatic models for the propagation of coherent waves in random S-matrix network models cover universal localization-delocalization properties and have some advantages over more…
Given a collection $\{\lambda_1, \dots, \lambda_n\} $ of real numbers, there is a canonical probability distribution on the set of real symmetric or complex Hermitian matrices with eigenvalues $\lambda_1,\ldots,\lambda_n$. In this paper, we…
We derive new perturbation bounds for eigenvalues of Hermitian matrices with block structures. The structures we consider range from a standard 2-by-2 block form to block tridiagonal and tridigaonal forms. The main idea is the observation…
We perform an extensive numerical analysis of $\beta$-skeleton graphs, a particular type of proximity graphs. In a $\beta$-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter…
We study spectral behavior of sparsely connected random networks under the random matrix framework. Sub-networks without any connection among them form a network having perfect community structure. As connections among the sub-networks are…
Consider an ensemble of $N\times N$ non-Hermitian matrices in which all entries are independent identically distributed complex random variables of mean zero and absolute mean-square one. If the entry distributions also possess bounded…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…