Entrywise bounds for eigenvectors of random graphs

MaRDI QIDQ2380297zbMATH OpenFDO

Authors Pradipta Mitra

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/229394, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r131.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Sparse random graphs: eigenvalues and eigenvectors
• The First Eigenvalue of Random Graphs
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Delocalization of eigenvectors of random matrices. Lecture notes
• Eigenvectors of random matrices: A survey

Cited in

(10)

• The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising
• On the cycle space of a random graph
• Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
• Concentration of hitting times in Erdős-Rényi graphs
• Eigenvectors of random matrices: A survey
• Vertices cannot be hidden from quantum spatial search for almost all random graphs
• Eigenvector delocalization for non‐Hermitian random matrices and applications
• Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
• Tail bounds for gaps between eigenvalues of sparse random matrices
• Concentration of the spectral norm of Erdős-Rényi random graphs

This page was built for publication: Entrywise bounds for eigenvectors of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380297)