Duality in inhomogeneous random graphs, and the cut metric
The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often...
Päätekijät: | Janson, S, Riordan, O |
---|---|
Aineistotyyppi: | Journal article |
Kieli: | English |
Julkaistu: |
2009
|
Samankaltaisia teoksia
-
Susceptibility in inhomogeneous random graphs
Tekijä: Janson, S, et al.
Julkaistu: (2009) -
The cut metric, random graphs, and branching processes
Tekijä: Bollobas, B, et al.
Julkaistu: (2009) -
The phase transition in inhomogeneous random graphs
Tekijä: Bollobas, B, et al.
Julkaistu: (2005) -
Sparse graphs: metrics and random models
Tekijä: Bollobas, B, et al.
Julkaistu: (2008) -
Sparse random graphs with clustering
Tekijä: Bollobas, B, et al.
Julkaistu: (2008)