Abstract
We investigate the role of the 1- and ∞-norms of eigenvectors in spectral graph theory. In particular, we produce several randomized algorithms which show that various graph-theoretic parameters can be tightly bounded by the eigenvalues as well as norms of the corresponding eigenvectors. Further, in some cases, these inequalities can determine the parameters exactly. Our results include: a spectral bound for the densest subgraph problem, an adapted “converse” to the Expander Mixing Lemma, and an adapted spectral approach to the maximum cut problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
