{
  "id": "1208.2171",
  "version": "v1",
  "published": "2012-08-10T13:42:11.000Z",
  "updated": "2012-08-10T13:42:11.000Z",
  "title": "Finding hitting times in various graphs",
  "authors": [
    "Shravas Rao"
  ],
  "categories": [
    "math.PR",
    "cs.DM",
    "math.CO"
  ],
  "abstract": "The hitting time, h_uv, of a random walk on a finite graph G, is the expected time for the walk to reach vertex v given that it started at vertex u. We present two methods of calculating the hitting time between vertices of finite graphs, along with applications to specific classes of graphs, including grids, trees, and the 'tadpole' graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-08-10T13:42:11.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "finding hitting times",
      "finite graph",
      "random walk",
      "reach vertex",
      "specific classes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1208.2171R"
    }
  }
}