Asymptotic Equivalence and Contiguity of Some Random Graphs
2010 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 36, no 1, 26-45 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2010. Vol. 36, no 1, 26-45 p.
contiguity, asymptotic equivalence, random graphs, Hellinger distance
IdentifiersURN: urn:nbn:se:uu:diva-138154DOI: 10.1002/rsa.20297ISI: 000273061700004OAI: oai:DiVA.org:uu-138154DiVA: diva2:378874