A simple branching process approach to the phase transition in $G_{n,p}$
It is well known that the branching process approach to the study of the random graph $G_{n,p}$ gives a very simple way of understanding the size of the giant component when it is fairly large (of order $\Theta(n)$). Here we show that a variant of this approach works all the way down to the phase tr...
Main Authors: | Bollobas, B, Riordan, O |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2012
|
Similar Items
-
The cut metric, random graphs, and branching processes
by: Bollobas, B, et al.
Published: (2009) -
The phase transition in inhomogeneous random graphs
by: Bollobas, B, et al.
Published: (2005) -
The phase transition in the uniformly grown random graph has infinite order
by: Bollobas, B, et al.
Published: (2005) -
An old approach to the giant component problem
by: Bollobas, B, et al.
Published: (2012) -
Achlioptas process phase transitions are continuous
by: Riordan, O, et al.
Published: (2011)