The Rank of Random Graphs

Simple item page
dc.creatorCostello, Kevin P.
dc.creatorVu, Van H.
dc.date2006-06-17
dc.date.accessioned2026-07-07T07:17:23Z
dc.date.available2026-07-07T07:17:23Z
dc.descriptionWe show that almost surely the rank of the adjacency matrix of the Erdös-Rényi random graph $G(n,p)$ equals the number of non-isolated vertices for any $c\ln n/n<p<1/2$, where $c$ is an arbitrary positive constant larger than 1/2. In particular, the giant component (a.s.) has full rank in this range.
dc.description19 pages, no figures
dc.identifierhttps://arxiv.org/abs/math/0606414
dc.identifierhttp://arxiv.org/abs/math/0606414
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113920
dc.subjectProbability
dc.subjectCombinatorics
dc.subject15A52
dc.titleThe Rank of Random Graphs
dc.typetext

Files

Collections

arXiv