Skip to main content
×
×
Home

On the Fluctuations of the Giant Component

  • D. BARRAEZ (a1), S. BOUCHERON (a2) and W. FERNANDEZ DE LA VEGA (a2)
    • Published online: 01 November 2000
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.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed