The component structure of dense random subgraphs of the hypercube

Given p ∈ (0, 1), we let Qp = Qdp be the random subgraph of the d‐dimensional hypercube Qd where edges are present independently with probability p. It is well known that, as d → ∞, if p > 1/2 then with high probability Qp is connected; and if p < 1/2 then with high probability Qp consists of...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: McDiarmid, C, Scott, A, Withers, P
Formáid: Journal article
Teanga:English
Foilsithe / Cruthaithe: Wiley 2021