Algebraic Structure and Complexity of Bootstrap Percolation with External Inputs

In this paper a modification of the standard Bootstrap Percolation model is introduced. In our modification a discrete time update rule is constructed that allows for non-monotonicity—unlike its classical counterpart. External inputs to drive the system into desirable states are also included in the model. The algebraic structure and complexity properties of the system are inferred by studying the system’s holonomy decomposition. We introduce methods of inferring the pools of reversibility for the system. Dependence of system complexity on process parameters is presented and discussed.