{
  "id": "1608.00800",
  "version": "v1",
  "published": "2016-08-02T13:06:27.000Z",
  "updated": "2016-08-02T13:06:27.000Z",
  "title": "A simple proof of almost percolation on G(n;p)",
  "authors": [
    "Mihyun Kang",
    "Tamás Makai"
  ],
  "comment": "18 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We consider bootstrap percolation on the binomial random graph $G(n,p)$ with infection threshold $r\\in \\mathbb{N}$, an infection process which starts from a set of initially infected vertices and in each step every vertex with at least $r$ infected neighbours becomes infected. We improve the results of Janson, \\L uczak, Turova, and Valier (2012) by strengthening the probability bounds on the number of infected vertices at the end of the process, using simple arguments based on martingales and giant components.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-08-02T13:06:27.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "simple proof",
      "binomial random graph",
      "infection threshold",
      "infection process",
      "bootstrap percolation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}