Sciweavers

RSA
2010

Asymptotic equivalence and contiguity of some random graphs

13 years 7 months ago
Asymptotic equivalence and contiguity of some random graphs
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than what might naively be expected. One application is a simple proof of a recent result by van den Esker, van der Hofstad and Hooghiemstra on the equivalence between graph distances for some random graph models.
Svante Janson
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where RSA
Authors Svante Janson
Comments (0)