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...
Váldodahkki: | Riordan, O |
---|---|
Materiálatiipa: | Journal article |
Giella: | English |
Almmustuhtton: |
2005
|
Geahča maid
-
Slow emergence of the giant component in the growing m-out graph
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2005) -
Asymptotic normality of the size of the giant component in a random hypergraph
Dahkki: Bollobás, B, et al.
Almmustuhtton: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2010) -
Asymptotic normality of the size of the giant component via a random walk
Dahkki: Bollobás, B, et al.
Almmustuhtton: (2011)