On the largest eigenvalue of a sparse random subgraph of the hypercube
Skip to main content
eScholarship
Open Access Publications from the University of California

On the largest eigenvalue of a sparse random subgraph of the hypercube

  • Author(s): Soshnikov, Alexander
  • et al.

Published Web Location

https://arxiv.org/pdf/math/0107229.pdf
No data is associated with this publication.
Abstract

We consider a sparse random subraph of the $n$-cube where each edge appears independently with small probability $p(n) =O(n^{-1+o(1)})$. In the most interesting regime when $p(n)$ is not exponentially small we prove that the largest eigenvalue of the graph is asymtotically equal to the square root of the maximum degree.

Item not freely available? Link broken?
Report a problem accessing this item