相关论文: Unified $\ell_{2\rightarrow\infty}$ Eigenspace Per…
In this text, based on elementary computations, we provide a perturbative expansion of the coordinates of the eigenvectors of a Hermitian matrix of large size perturbed by a random matrix with small operator norm whose entries in the…
Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…
We discuss the applicability, within the Random Matrix Theory, of perturbative treatment of symmetry breaking to the experimental data on the flip symmetry breaking in quartz crystal. We found that the values of the parameter that measures…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
We apply the operation of random independent thinning on the eigenvalues of $n\times n$ Haar distributed unitary random matrices. We study gap probabilities for the thinned eigenvalues, and we study the statistics of the eigenvalues of…
Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…
Low-rank pseudoinverses are widely used to approximate matrix inverses in scalable machine learning, optimization, and scientific computing. However, real-world matrices are often observed with noise, arising from sampling, sketching, and…
We consider the eigenvalues of a fixed, non-normal matrix subject to a small additive perturbation. In particular, we consider the case when the fixed matrix is a banded Toeplitz matrix, where the bandwidth is allowed to grow slowly with…
In this paper, we study the relative perturbation bounds for joint eigenvalues of commuting tuples of normal $n \times n$ matrices. Some Hoffman-Wielandt type relative perturbation bounds are proved using the Clifford algebra technique. A…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
We consider the eigenvalues and eigenvectors of small rank perturbations of random $N\times N$ matrices. We allow the rank of perturbation $M$ increases with $N$, and the only assumption is $M=o(N)$. In both additive and multiplicative…
We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate…
We consider the eigenvalues and eigenvectors of finite, low rank perturbations of random matrices. Specifically, we prove almost sure convergence of the extreme eigenvalues and appropriate projections of the corresponding eigenvectors of…
The current work applies some recent combinatorial tools due to Jain to control the eigenvalue gaps of a matrix $M_n = M + N_n$ where $M$ is deterministic, symmetric with large operator norm and $N_n$ is a random symmetric matrix with…
Previous results indicate that while chaos can lead to substantial entropy production, thereby maximizing dynamical entanglement, this still falls short of maximality. Random Matrix Theory (RMT) modeling of composite quantum systems,…
In this letter, we provide a simple algorithm, anyPUB, to systematically derive the $2 \rightarrow 2$ scattering matrix in the high-energy limit for any kind of models, irrespective of their gauge group or their field representation. After…
We consider the empirical eigenvalue distribution of an $m\times m$ principle submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. Earlier work of Petz and R\'effy identified the limiting spectral measure…
We prove quadratic eigenvalue perturbation bounds for generalized Hermitian eigenvalue problems. The bounds are proportional to the square of the norm of the perturbation matrices divided by the gap between the spectrums. Using the results…
Consider $N\times N$ symmetric one-dimensional random band matrices with general distribution of the entries and band width $W \geq N^{3/4+\varepsilon}$ for any $\varepsilon>0$. In the bulk of the spectrum and in the large $N$ limit, we…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…