Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEigenvalue Statistics for Generalized Symmetric and Hermitian Matrices
290
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The Nearest Neighbour Spacing (NNS) distribution can be computed for generalized symmetric 2x2 matrices having different variances in the diagonal and in the off-diagonal elements. Tuning the relative value of the variances we show that the distributions of the level spacings exhibit a crossover from clustering to repulsion as in GOE. The analysis is extended to 3x3 matrices where distributions of NNS as well as Ratio of Nearest Neighbour Spacing (RNNS) show similar crossovers. We show that it is possible to calculate NNS distributions for Hermitian matrices (N=2, 3) where also crossovers take place between clustering and repulsion as in GUE. For large symmetric and Hermitian matrices we use interpolation between clustered and repulsive regimes and identify phase diagrams with respect to the variances.
rate research
Read More
We study the joint probability density of the eigenvalues of a product of rectangular real, complex or quaternion random matrices in a unified way. The random matrices are distributed according to arbitrary probability densities, whose only restriction is the invariance under left and right multiplication by orthogonal, unitary or unitary symplectic matrices, respectively. We show that a product of rectangular matrices is statistically equivalent to a product of square matrices. Hereby we prove a weak commutation relation of the random matrices at finite matrix sizes, which previously have been discussed for infinite matrix size. Moreover we derive the joint probability densities of the eigenvalues. To illustrate our results we apply them to a product of random matrices drawn from Ginibre ensembles and Jacobi ensembles as well as a mixed version thereof. For these weights we show that the product of complex random matrices yield a determinantal point process, while the real and quaternion matrix ensembles correspond to Pfaffian point processes. Our results are visualized by numerical simulations. Furthermore, we present an application to a transport on a closed, disordered chain coupled to a particle bath.
Rectangular real $N times (N + u)$ matrices $W$ with a Gaussian distribution appear very frequently in data analysis, condensed matter physics and quantum field theory. A central question concerns the correlations encoded in the spectral statistics of $WW^T$. The extreme eigenvalues of $W W^T$ are of particular interest. We explicitly compute the distribution and the gap probability of the smallest non-zero eigenvalue in this ensemble, both for arbitrary fixed $N$ and $ u$, and in the universal large $N$ limit with $ u$ fixed. We uncover an integrable Pfaffian structure valid for all even values of $ ugeq 0$. This extends previous results for odd $ u$ at infinite $N$ and recursive results for finite $N$ and for all $ u$. Our mathematical results include the computation of expectation values of half integer powers of characteristic polynomials.
We consider $N$ by $N$ deformed Wigner random matrices of the form $X_N=H_N+A_N$, where $H_N$ is a real symmetric or complex Hermitian Wigner matrix and $A_N$ is a deterministic real bounded diagonal matrix. We prove a universal Central Limit Theorem for the linear eigenvalue statistics of $X_N$ for all mesoscopic scales both in the spectral bulk and at regular edges where the global eigenvalue density vanishes as a square root. The method relies on the characteristic function method in [47], local laws for the Green function of $X_N$ in [3, 46, 51] and analytic subordination properties of the free additive convolution [24, 41]. We also prove the analogous results for high-dimensional sample covariance matrices.
We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density amounts to classical probability, in which the matrices are assumed to commute; the other extreme is related to free probability, in which the eigenvectors are assumed to be in generic positions and sufficiently large. In practice, free probability theory can give a good approximation of the density. We develop a technique based on eigenvector localization/delocalization that works very well for important problems of interest where free probability is not sufficient, but certain uniformity properties apply. The localization/delocalization property appears in a convex combination parameter that notably, is independent of any eigenvalue properties and yields accurate eigenvalue density approximations. We demonstrate this technique on a number of examples as well as discuss a more general technique when the uniformity properties fail to apply.
Using two simple examples, the continuous-time random walk as well as a two state Markov chain, the relation between generalized anomalous relaxation equations and semi-Markov processes is illustrated. This relation is then used to discuss continuous-time random statistics in a general setting, for statistics of convolution-type. Two examples are presented in some detail: the sum statistic and the maximum statistic.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
