{
  "id": "0802.1637",
  "version": "v1",
  "published": "2008-02-12T13:18:37.000Z",
  "updated": "2008-02-12T13:18:37.000Z",
  "title": "Asymptotic equivalence and contiguity of some random graphs",
  "authors": [
    "Svante Janson"
  ],
  "comment": "21 pages",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-02-12T13:18:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60G30",
      "05C80",
      "60C05"
    ],
    "keywords": [
      "asymptotic equivalence",
      "random graph models",
      "contiguity",
      "van der hofstad",
      "van den esker"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0802.1637J"
    }
  }
}