Asymptotic equivalence and contiguity of some random graphs

Simple item page
dc.creatorJanson, Svante
dc.date2008-02-12
dc.date.accessioned2026-07-07T09:20:15Z
dc.date.available2026-07-07T09:20:15Z
dc.descriptionWe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/0802.1637
dc.identifierhttp://arxiv.org/abs/0802.1637
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154660
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60G30; 05C80; 60C05
dc.titleAsymptotic equivalence and contiguity of some random graphs
dc.typetext

Files

Collections

arXiv