Duality in Inhomogeneous Random Graphs, and the Cut Metric
2011 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 39, no 3, 399-411 p.Article in journal (Refereed) Published
The classical random graph model G(n, c/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 much easier to study the subcritical model than to directly study small components in the supercritical model. Here we prove a duality principle of this type for a very general class of random graphs with independence between the edges, defined by convergence of the matrices of edge probabilities in the cut metric.
Place, publisher, year, edition, pages
2011. Vol. 39, no 3, 399-411 p.
cut metric, random graph duality
IdentifiersURN: urn:nbn:se:uu:diva-158565DOI: 10.1002/rsa.20348ISI: 000294266600004OAI: oai:DiVA.org:uu-158565DiVA: diva2:440578