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 |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado: |
2005
|
Títulos similares
-
Slow emergence of the giant component in the growing m-out graph
por: Bollobas, B, et al.
Publicado: (2005) -
Asymptotic normality of the size of the giant component in a random hypergraph
por: Bollobás, B, et al.
Publicado: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
por: Bollobas, B, et al.
Publicado: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
por: Bollobas, B, et al.
Publicado: (2010) -
Asymptotic normality of the size of the giant component via a random walk
por: Bollobás, B, et al.
Publicado: (2011)