The small giant component in scale-free random graphs
Building on the methods developed in joint work with Béla Bollobás and Svante Janson, we study the phase transition in four 'scale-free' random graph models, obtaining upper and lower bounds on the size of the giant component when there is one. In particular, we determine the extremely slo...
Main Author: | Riordan, O |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2005
|
Similar Items
-
Slow emergence of the giant component in the growing m-out graph
by: Bollobas, B, et al.
Published: (2005) -
Asymptotic normality of the size of the giant component in a random hypergraph
by: Bollobás, B, et al.
Published: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
by: Bollobas, B, et al.
Published: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
by: Bollobas, B, et al.
Published: (2010) -
Asymptotic normality of the size of the giant component via a random walk
by: Bollobás, B, et al.
Published: (2011)