Large components in random induced subgraphs of n-cubes

TL;DR

This paper investigates the emergence and size of the largest component in random induced subgraphs of n-cubes, establishing conditions for the existence of a unique giant component and its asymptotic size.

Contribution

It introduces a novel construction for analyzing subcomponents and extends prior results by allowing the parameter b5_n to vary with n, providing more precise asymptotic sizes.

Findings

Existence of a unique largest component almost surely.

Asymptotic size of the largest component for b5_n=b5.

Extension of previous results to variable b5_n.

Abstract

In this paper we study random induced subgraphs of the binary $n$-cube, $Q_2^n$. This random graph is obtained by selecting each $Q_2^n$-vertex with independent probability $\lambda_n$. Using a novel construction of subcomponents we study the largest component for $\lambda_n=\frac{1+\chi_n}{n}$, where $\epsilon\ge \chi_n\ge n^{-{1/3}+ \delta}$, $\delta>0$. We prove that there exists a.s. a unique largest component $C_n^{(1)}$. We furthermore show that $\chi_n=\epsilon$, $| C_n^{(1)}|\sim \alpha(\epsilon) \frac{1+\chi_n}{n} 2^n$ and for $o(1)=\chi_n\ge n^{-{1/3}+\delta}$, $| C_n^{(1)}| \sim 2 \chi_n \frac{1+\chi_n}{n} 2^n$ holds. This improves the result of \cite{Bollobas:91} where constant $\chi_n=\chi$ is considered. In particular, in case of $\lambda_n=\frac{1+\epsilon} {n}$, our analysis implies that a.s. a unique giant component exists.