Related papers: Random Matrices from Linear Codes and Wigner's Sem…
We investigate the Wasserstein distance between the empirical spectral distribution of non-Hermitian random matrices and the Circular Law. For general entry distributions, we obtain a nearly optimal rate of convergence in 1-Wasserstein…
We investigate whether the Wigner semi-circle and Marcenko-Pastur distributions, often used for deep neural network theoretical analysis, match empirically observed spectral densities. We find that even allowing for outliers, the observed…
The Wigner time delay is a measure of the time spent by a particle inside the scattering region of an open system. For chaotic systems, the statistics of the individual delay times (whose average is the Wigner time delay) are thought to be…
This thesis consists of two independent parts: random matrices, which form the first one-third of this thesis, and machine learning, which constitutes the remaining part. The main results of this thesis are as follows: a necessary and…
Although the spectra of random networks have been studied for a long time, the influence of network topology on the dense limit of network spectra remains poorly understood. By considering the configuration model of networks with four…
We use the idea of a Wigner surmise to compute approximate distributions of the first eigenvalue in chiral Random Matrix Theory, for both real and complex eigenvalues. Testing against known results for zero and maximal non-Hermiticity in…
These notes provide an introduction to the local semicircle law from random matrix theory, as well as some of its applications. We focus on Wigner matrices, Hermitian random matrices with independent upper-triangular entries with zero…
Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…
We consider $N\times N$ Hermitian random matrices with i.i.d. entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. We study the connection between eigenvalue statistics on…
We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…
We analyze the spectral distribution of symmetric random matrices with correlated entries. While we assume that the diagonals of these random matrices are stochastically independent, the elements of the diagonals are taken to be correlated.…
We investigate the spectral distribution of random matrix ensembles with correlated entries. We consider symmetric matrices with real valued entries and stochastically independent diagonals. Along the diagonals the entries may be…
We introduce kernel estimators for the semicircle law. In this first part of our general theory on the estimators, we prove the consistency and conduct simulation study to show the performance of the estimators. We also point out that…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
The aim of this note is to investigate the Kolmogorov distance of the Circular Law to the empirical spectral distribution of non-Hermitian random matrices with independent entries. The optimal rate of convergence is determined by the…
We extend the random characteristics approach to Wigner matrices whose entries are not required to have a normal distribution. As an application, we give a simple and fully dynamical proof of the weak local semicircle law in the bulk.
We study the normalized eigenvalue counting measure d\sigma of matrices of long-range percolation model. These are (2n+1)\times (2n+1) random real symmetric matrices H=\{H(i,j)\}_{i,j} whose elements are independent random variables taking…
We introduce a new technique to prove bounds for the spectral radius of a random matrix, based on using Jensen's formula to establish the zerofreeness of the associated characteristic polynomial in a region of the complex plane. Our…
We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…
Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…