On the Fluctuations of the Giant Component

Source abstract

We provide an alternate proof of the central limit theorem for the uctuations of the size of the giant component in sparse random graphs. In contrast with previous proofs, the argument investigates a depth-first search algorithm, through first-passage analysis using couplings and martingale limit theorems. The analysis of the first passage limiting distribution for sequences of Markov chains might be interesting in its own right. This proof naturally provides an upper bound for the rate of convergence.