Bootstrap Percolation

Bootstrap Percolation is a deterministic cellular automaton process in percolation theory where vertices of a graph are initially infected independently with a fixed probability, and subsequently, healthy vertices become infected if they have at least a specified threshold number of infected neighbors, modeling the spread of activity or information through a network under local influence rules.

127

Publications

7.5K

Citations

169

Authors

154

Institutions

Publications per year

2017–2026

21

Authors

169

  1. BB
    Béla Bollobás

    University of Memphis, United States

    14 publications · 742 citations

    12

    h-index

  2. RM
    Robert Morris

    Instituto Nacional de Matemática Pura e Aplicada, Brazil

    12 publications · 781 citations

    11

    h-index

  3. JB
    József Balogh

    University of Illinois Urbana-Champaign, United States

    10 publications · 817 citations

    10

    h-index

  4. JA
    Joan Adler

    Technion – Israel Institute of Technology, Israel

    6 publications · 355 citations

    6

    h-index

  5. AE
    Alexander E. Holroyd

    Microsoft (United States), United States

    5 publications · 463 citations

    5

    h-index

1–5 of 169

Venues

  1. Journal of Statistical Physics

    13 publications · 548 citations

    12

    h-index

  2. The Annals of Probability

    8 publications · 522 citations

    8

    h-index

  3. The Electronic Journal of Combinatorics

    7 publications · 238 citations

    7

    h-index

  4. Physical Review E

    PRE · 6 publications · 426 citations

    6

    h-index

  5. Combinatorics Probability Computing

    5 publications · 326 citations

    5

    h-index

1–5