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...
Auteur principal: | Riordan, O |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
2005
|
Documents similaires
-
Slow emergence of the giant component in the growing m-out graph
par: Bollobas, B, et autres
Publié: (2005) -
Asymptotic normality of the size of the giant component in a random hypergraph
par: Bollobás, B, et autres
Publié: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
par: Bollobas, B, et autres
Publié: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
par: Bollobas, B, et autres
Publié: (2010) -
Asymptotic normality of the size of the giant component via a random walk
par: Bollobás, B, et autres
Publié: (2011)