The component structure of dense random subgraphs of the hypercube

Journal article

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 one giant component together with many smaller components which form the “fragment”. Here we fix p ∈ (0, 1/2) , and investigate the fragment, and how it sits inside the hypercube. For example, we give asymptotic estimates for the mean numbers of components in the fragment of each size, and describe their asymptotic distributions, much extending earlier work of Weber

Authors: McDiarmid, C; Scott, A; Withers, P

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Wiley
• Journal: Random Structures and Algorithms
• Volume: 59
• Issue: 1
• Pages: 3-24
• Publication date: 2021-02-12
• Acceptance date: 2020-06-16
• DOI: 10.1002/rsa.20990
• EISSN: 1098-2418
• ISSN: 1042-9832
• Language: English
• Keywords: FFR; random graphs; hypercube