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...
| Autors principals: | , , |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
Wiley
2021
|