what

WHAT is BOOTSTRAP PERCOLATION?

  1. Occupy a lattice randomly with probability p, then iteratively remove all sites that do not have at least m neighbours.

  2. For m=1 remove isolated sites.
    pic 4m=1 BP arrow after culling

  3. For m=2 remove dangling ends.
    pic 4 m=1 BP arrow after culling

  4. For m=3 and above its interesting and currently I understand quite hot amongst probablists.

  5. For sufficiently high m, no occupied sites remain, and the interest is in the scaling as a function of system size.

[BACK]