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...
Autor principal: | Riordan, O |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2005
|
Ítems similars
-
Slow emergence of the giant component in the growing m-out graph
per: Bollobas, B, et al.
Publicat: (2005) -
Asymptotic normality of the size of the giant component in a random hypergraph
per: Bollobás, B, et al.
Publicat: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
per: Bollobas, B, et al.
Publicat: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
per: Bollobas, B, et al.
Publicat: (2010) -
Asymptotic normality of the size of the giant component via a random walk
per: Bollobás, B, et al.
Publicat: (2011)