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...
1. autor: | Riordan, O |
---|---|
Format: | Journal article |
Język: | English |
Wydane: |
2005
|
Podobne zapisy
-
Slow emergence of the giant component in the growing m-out graph
od: Bollobas, B, i wsp.
Wydane: (2005) -
Asymptotic normality of the size of the giant component in a random hypergraph
od: Bollobás, B, i wsp.
Wydane: (2012) -
Asymptotic normality of the size of the giant component in a random
hypergraph
od: Bollobas, B, i wsp.
Wydane: (2011) -
Asymptotic normality of the size of the giant component via a random
walk
od: Bollobas, B, i wsp.
Wydane: (2010) -
Asymptotic normality of the size of the giant component via a random walk
od: Bollobás, B, i wsp.
Wydane: (2011)