相关论文: Power law eigenvalue density, scaling and critical…
A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…
In this brief paper the probability density of a random real, complex and quaternion determinant is rederived using singular values. The behaviour of suitably rescaled random determinants is studied in the limit of infinite order of the…
We evaluate analytically and numerically the size of the frozen core and various scaling laws for critical Boolean networks that have a power-law in- and/or out-degree distribution. To this purpose, we generalize an efficient method that…
In this article we study the fluctuation of linear statistics of eigenvalues of circulant, symmetric circulant, reverse circulant and Hankel matrices. We show that the linear spectral statistics of these matrices converges to the Gaussian…
The structure function of a random matrix ensemble can be specified as the covariance of the linear statistics $\sum_{j=1}^N e^{i k_1 \lambda_j}$, $\sum_{j=1}^N e^{-i k_2 \lambda_j}$ for Hermitian matrices, and the same with the eigenvalues…
We study the characteristic polynomial of Haar distributed random unitary matrices. We show that after a suitable normalization, as one increases the size of the matrix, powers of the absolute value of the characteristic polynomial as well…
We review the state of the art of the theory of Euclidean random matrices, focusing on the density of their eigenvalues. Both Hermitian and non-Hermitian matrices are considered and links with simpler, standard random matrix ensembles are…
Let $A$ be a fixed complex matrix and let $u,v$ be two vectors. The eigenvalues of matrices $A+\tau uv^\top $ $(\tau\in\mathbb{R})$ form a system of intersecting curves. The dependence of the intersections on the vectors $u,v$ is studied.
The density matrix of a non-relativistic quantum system, divided into $N$ sub-systems, is rewritten in terms of the set of all partitioned density matrices for the system. For the case where the different sub-systems are distinguishable, we…
The $\beta$ ensembles are a class of eigenvalue probability densities which generalise the invariant ensembles of classical random matrix theory. In the case of the Gaussian and Laguerre weights, the corresponding eigenvalue densities are…
We determine the Waring rank of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups.
We give an overview of the recursive characterisations of random matrix ensembles that are currently at the forefront of random matrix theory by way of studying two classes of ensembles using two different types of recursive schemes:…
Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…
We investigate the eigenvalue distribution of the snapshot density matrix (SDM) generated by Monte Carlo simulation for two-dimensional classical spin systems. We find that the distribution in the high-temperature limit is well explained by…
We consider an ensemble of large non-Hermitian random matrices of the form $\hat{H}+i\hat{A}_s$, where $\hat{H}$ and $\hat{A}_s$ are Hermitian statistically independent random $N\times N$ matrices. We demonstrate the existence of a new…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
We consider the mass-dependent aggregation process (k+1)X -> X, given a fixed number of unit mass particles in the initial state. One cluster is chosen proportional to its mass and is merged into one either with k-neighbors in one…
The goal of this article is to study how much the eigenvalues of large Hermitian random matrices deviate from certain deterministic locations -- or in other words, to investigate optimal rigidity estimates for the eigenvalues. We do this in…
We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the…
There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…