{
  "id": "1605.02995",
  "version": "v1",
  "published": "2016-05-10T13:19:54.000Z",
  "updated": "2016-05-10T13:19:54.000Z",
  "title": "Bootstrap percolation on G(n,p) revisited",
  "authors": [
    "Mihyun Kang",
    "Tamás Makai"
  ],
  "comment": "12 pages, to appear in Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland, 4-8 July 2016",
  "categories": [
    "math.CO"
  ],
  "abstract": "Bootstrap percolation on a graph with infection threshold $r\\in \\mathbb{N}$ is 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 consider bootstrap percolation on the binomial random graph $G(n,p)$, which was investigated among others by Janson, \\L uczak, Turova and Valier (2012). We improve their results by strengthening the probability bounds for the number of infected vertices at the end of the process.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-05-10T13:19:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80"
    ],
    "keywords": [
      "bootstrap percolation",
      "binomial random graph",
      "infection process",
      "infection threshold",
      "probability bounds"
    ],
    "tags": [
      "conference paper"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}