The order in which this removal occurs makes no difference to the final stable state.
[3] If the initial state is active everywhere except for an n × n square, within which one cell in each row and column is inactive, then these single-cell voids will merge to form a void that covers the whole square if and only if the inactive cells have the pattern of a separable permutation.
[5] The smallest threshold that allows some cells of an initial cluster to survive is called the degeneracy of its adjacency graph, and the remnant of a cluster that survives with threshold k is called the k-core of this graph.
[8] One application of bootstrap percolation arises in the study of fault tolerance for distributed computing.
The analysis of bootstrap percolation can be used to determine the failure probability that can be tolerated by the system.