On the concentration of eigenvalues of random symmetric matrices
From MaRDI portal
Publication:1852724
DOI10.1007/BF02785860zbMath1014.15016OpenAlexW2061109699MaRDI QIDQ1852724
Michael Krivelevich, Noga Alon, Van H. Vu
Publication date: 30 June 2003
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02785860
Related Items
Concentration of norms and eigenvalues of random matrices, Concentration of the spectral norm of Erdős-Rényi random graphs, Erratum to: Outliers in the spectrum of iid matrices with bounded rank perturbations, A simple spectral algorithm for recovering planted partitions, Spectra of edge-independent random graphs, Angular synchronization by eigenvectors and semidefinite programming, The spectra of random mixed graphs, The spectral gap of random regular graphs, Upper Tails for Edge Eigenvalues of Random Graphs, Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time, Verified error bounds for real eigenvalues of real symmetric and persymmetric matrices, On the cycle space of a random graph, On the spectra of general random mixed graphs, Sampling based succinct matrix approximation, Random matrices, nonbacktracking walks, and orthogonal polynomials, Singular vectors under random perturbation, Concentration for noncommutative polynomials in random matrices, Rigidity of eigenvalues of generalized Wigner matrices, Noisy random graphs and their laplacians, Local tail bounds for functions of independent random variables, Spectral norm of random matrices, Wigner random matrices with non-symmetrically distributed entries, Graphs with integral spectrum, Markov chain methods for analyzing urban networks, Sparse regular random graphs: spectral density and eigenvectors, Random matrices: The distribution of the smallest singular values, Eigenvectors of random graphs: Nodal Domains, Spectral edge in sparse random graphs: upper and lower tail large deviations, Generalized quasirandom properties of expanding graph sequences, Algorithm and software for defining the distribution of eigenvalues of random symmetric matrices via simulation, On the computational tractability of statistical estimation on amenable graphs, A spectral signature of breaking of ensemble equivalence for constrained random graphs, Some counting questions for matrices with restricted entries, Singular value decomposition of large random matrices (for two-way classification of microarrays), RANDOM MATRICES: SHARP CONCENTRATION OF EIGENVALUES, Loose laplacian spectra of random hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characteristic vectors of bordered matrices with infinite dimensions
- On the distribution of the roots of certain symmetric matrices
- The eigenvalues of random symmetric matrices
- Level-spacing distributions and the Airy kernel
- Concentration of the spectral measure for large matrices
- Universality at the edge of the spectrum in Wigner random matrices.
- Concentration of measure and isoperimetric inequalities in product spaces
- On orthogonal and symplectic matrix ensembles
