WHAT is BOOTSTRAP PERCOLATION?
- Occupy a lattice randomly with probability p,
then iteratively remove all sites that do not have at least m
- For m=1 remove isolated sites.
- For m=2 remove dangling ends.
- For m=3 and above its interesting
and currently I understand quite
hot amongst probablists.
- For sufficiently high m, no occupied sites remain,
and the interest is in the scaling as a function of system size.