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...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy: Janson, S, Riordan, O
Format: Journal article
Język:English
Wydane: 2009