Related papers: Universality in several-matrix models via approxim…

We study the asymptotic behavior of the eigenvalues of Gaussian perturbations of large Hermitian random matrices for which the limiting eigenvalue density vanishes at a singular interior point or vanishes faster than a square root at a…

We state and prove several theorems that demonstrate how the coordinate Bethe Ansatz for the eigenvectors of suitable transfer matrices of a generalised inhomogeneous five-vertex model on the square lattice, given certain conditions hold,…

We discuss the concept of width-to-spacing ratio which plays the central role in the description of local spectral statistics of evolution operators in multiplicative and additive stochastic processes for random matrices. We show that the…

Laplacian matrices are commonly employed in many real applications, encoding the underlying latent structural information such as graphs and manifolds. The use of the normalization terms naturally gives rise to random matrices with…

We develop a theory of multilevel distributions of eigenvalues which complements the Dyson's threefold $\beta=1,2,4$ approach corresponding to real/complex/quaternion matrices by $\beta=\infty$ point. Our central objects are G$\infty$E…

We prove universality at the edge for rescaled correlation functions of Wigner random matrices in the limit $n\to +\infty$. As a corollary, we show that, after proper rescaling, the 1st, 2nd, 3rd, etc. eigenvalues of Wigner random hermitian…

We prove a local convex version of Arveson's extension theorem and of Wittstock's extension theorem. Also we prove a Stinespring type theorem for unbounded local completely contractive maps.

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We obtain structural theorems for the so-called S-asymptotic and quasiasymptotic boundedness of ultradistributions. Using these results, we then analyze the moment asymptotic expansion (MAE), providing a full characterization of those…

We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides…

For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it is cyclic. This includes the probability that…

The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with n labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the…

We consider quadratic forms of deterministic matrices $A$ evaluated at the random eigenvectors of a large $N \times N$ GOE or GUE matrix, or equivalently evaluated at the columns of a Haar-orthogonal or Haar-unitary random matrix. We prove…

Quite often real-world networks can be thought of as being symmetric, in the abstract sense that vertices can be found to have similar or equivalent structural roles. However, traditional measures of symmetry in graphs are based on their…

We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…

We study random-matrix ensembles with a non-Gaussian probability distribution $P(H) \sim \exp (-N {\rm tr }\, V(H))$ where $N$ is the dimension of the matrix $H$ and $V(H)$ is independent of $N$. Using Efetov's supersymmetry formalism, we…

We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies reveal that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes…

We study asymptotics of generalized eigenvectors associated with Jacobi matrices. Under weak conditions on the coefficients we identify when the matrices are self-adjoint and show that they satisfy strong non-subordinacy condition.

We prove delocalization of eigenvectors of vertex-transitive graphs via elementary estimates of the spectral projector. We recover in this way known results which were formerly proved using representation theory. Similar techniques show…

We give a proof of the Universality Conjecture for orthogonal and symplectic ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial, V(x)=kappa_{2m}x^{2m}+..., kappa_{2m}>0. For such…