{
  "id": "math/0011092",
  "version": "v3",
  "published": "2000-11-14T21:11:14.000Z",
  "updated": "2002-02-26T00:59:22.000Z",
  "title": "On the mixing time of simple random walk on the super critical percolation cluster",
  "authors": [
    "Itai Benjamini",
    "Elchanan Mossel"
  ],
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\\Z^d$. We show that for $d \\geq 2$ and $p > p_c(\\Z^d)$, the mixing time of simple random walk on the largest cluster inside $\\{-n,...,n\\}^d$ is $\\Theta(n^2)$ - thus the mixing time is robust up to constant factor.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2002-02-26T00:59:22.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "simple random walk",
      "super critical percolation cluster",
      "mixing time",
      "percolation clusters inside boxes",
      "largest cluster inside"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2000math.....11092B"
    }
  }
}