{
  "id": "1708.04908",
  "version": "v1",
  "published": "2017-08-16T14:30:55.000Z",
  "updated": "2017-08-16T14:30:55.000Z",
  "title": "The covertime of a biased random walk on $G_{n,p}$",
  "authors": [
    "Colin Cooper",
    "Alan Frieze",
    "Samantha Petti"
  ],
  "categories": [
    "math.CO",
    "cs.DS",
    "math.PR"
  ],
  "abstract": "We analyze the covertime of a biased random walk on the random graph $G_{n,p}$. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-08-16T14:30:55.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "biased random walk",
      "low degree",
      "random graph",
      "visiting vertices"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}