Related papers: First eigenvalue/eigenvector in sparse random symm…
The largest eigenvalue of the adjacency matrix of a network plays an important role in several network processes (e.g., synchronization of oscillators, percolation on directed networks, linear stability of equilibria of network coupled…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
In contrast to the neatly bounded spectra of densely populated large random matrices, sparse random matrices often exhibit unbounded eigenvalue tails on the real and imaginary axis, called Lifshitz tails. In the case of asymmetric matrices,…
Given a sample covariance matrix, we solve a maximum likelihood problem penalized by the number of nonzero coefficients in the inverse covariance matrix. Our objective is to find a sparse representation of the sample data and to highlight…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…
This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…
We describe the distribution of the first finite number of eigenvalues in a newly-forming band of the spectrum of the random Hermitean matrix model. The method is rigorously based on the Riemann-Hilbert analysis of the corresponding…
Random matrices formed from i.i.d. standard real Gaussian entries have the feature that the expected number of real eigenvalues is non-zero. This property persists for products of such matrices, independently chosen, and moreover it is…
We investigate the statistics of the largest eigenvalue, $\lambda_{\rm max}$, in an ensemble of $N\times N$ large ($N\gg 1$) sparse adjacency matrices, $A_N$. The most attention is paid to the distribution and typical fluctuations of…
This work investigates the multiplicity and differentiability of eigenfrequencies in structures with various symmetries. In particular, the study explores how the geometric and design variable symmetries affect the distribution of…
In this paper, we use a new approach to prove that the largest eigenvalue of the sample covariance matrix of a normally distributed vector is bigger than the true largest eigenvalue with probability 1 when the dimension is infinite. We…
We are interested in two random matrix ensembles related to permutations: the ensemble of permutation matrices following Ewens' distribution of a given parameter $\theta >0$, and its modification where entries equal to $1$ in the matrices…
A large i.i.d. random matrix with deterministic low-rank perturbation has been extensively studied, particularly in the aspects of the ESD (Empirical Spectral Distribution) and the outliers of eigenvalues. In this work, we investigate the…
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…
Two-term asymptotic formulae for the probability distribution functions for the smallest eigenvalue of the Jacobi $ \beta $-Ensembles are derived for matrices of large size in the r\'egime where $ \beta > 0 $ is arbitrary and one of the…
In this article, we establish a limiting distribution for eigenvalues of a class of auto-covariance matrices. The same distribution has been found in the literature for a regularized version of these auto-covariance matrices. The original…
We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with…
We consider the uniform approximation of the smallest eigenvalue of a large parameter-dependent Hermitian matrix by that of a smaller counterpart obtained through projections. The projection subspaces are constructed iteratively by means of…
In this paper we examine the zero and first order eigenvalue fluctuations for the $\beta$-Hermite and $\beta$-Laguerre ensembles, using the matrix models we described in \cite{dumitriu02}, in the limit as $\beta \to \infty$. We find that…
A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and…