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...
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | Journal article |
| भाषा: | English |
| प्रकाशित: |
2009
|