I want to collect different proofs of Erdös-Rényi result on the double jump of the largest connected component on $G(n,p)$ (or in $G(n,M)$.

I know the original proof of Erdös-Rényi, the proof that uses Galton-Watson processes and the short proof of Sudakov and Krivelevich.

Are there other (essentially different) proofs of the result?


Nachmias, Asaf, and Yuval Peres. "The critical random graph, with martingales." Israel Journal of Mathematics 176, no. 1 (2010): 29-41.


| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.