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

Simple item page
dc.creatorSoshnikov, Alexander
dc.date2001-07-31
dc.date.accessioned2026-07-07T04:42:48Z
dc.date.available2026-07-07T04:42:48Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0107229
dc.identifierhttp://arxiv.org/abs/math/0107229
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61941
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subjectProbability
dc.titleOn the largest eigenvalue of a sparse random subgraph of the hypercube
dc.typetext

Files

Collections

arXiv