The component structure of dense random subgraphs of the hypercube

DOI10.1002/RSA.20990MaRDI QIDQ6074646zbMATH OpenOpenAlexFDO

Authors Colin McDiarmid, Alex Scott, Paul Withers

Publication date 12 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.06433, https://ora.ox.ac.uk/objects/uuid:7d3adbf6-a237-4ae5-9e18-1505495011d9

zbMATH Keywords

hypercuberandom graphs

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Abstract: Given $pin(0,1)$, we let $Q_p=Q_p^d$ be the random subgraph of the $d$-dimensional hypercube $Q^d$ where edges are present independently with probability $p$. It is well known that, as $dightarrowinfty$, if $p>frac12$ then with high probability $Q_p$ is connected; and if $p<frac12$ then with high probability $Q_p$ consists of one giant component together with many smaller components which form the `fragment'. Here we fix $pin(0,frac12)$, and investigate the fragment, and how it sits inside the hypercube. In particular we give asymptotic estimates for the mean numbers of components in the fragment of each size, and describe their asymptotic distributions and indeed their joint distribution, much extending earlier work of Weber.

Recommendations

• scientific article; zbMATH DE number 747047
• scientific article; zbMATH DE number 3966129
• scientific article; zbMATH DE number 4010568
• Large components in random induced subgraphs of \(n\)-cubes
• Random subgraphs of finite graphs. III: The phase transition for the n-cube

Cites work

• Complete matchings in random subgraphs of the cube
• Connectivity properties of random subgraphs of the cube
• Evolution of the n-cube
• scientific article; zbMATH DE number 4010568 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 3586242 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 747047 (Why is no real title available?)
• Largest random component of a k-cube
• Matchings and walks in graphs
• On the diameter and radius of randon subgraphs of the cube
• Paths in graphs
• Poisson Convergence in the n‐Cube
• Random subgraphs of finite graphs. III: The phase transition for the n-cube
• Slightly subcritical hypercube percolation
• The Evolution of Random Subgraphs of the Cube
• Uniform multicommodity flows in the hypercube with random edge‐capacities

Cited in

(8)

• Expansion in supercritical random subgraphs of the hypercube and its consequences
• Dense subgraphs in the H-free process
• scientific article; zbMATH DE number 747047 (Why is no real title available?)
• Climbing up a random subgraph of the hypercube
• Connectivity and dynamics for random subgraphs of the directed cube
• Improved bounds for 1-independent percolation on \(\mathbb{Z}^n\)
• Large induced subgraphs of random graphs with given degree sequences
• Hamiltonicity of random subgraphs of the hypercube

This page was built for publication: The component structure of dense random subgraphs of the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074646)