arXiv:2005.10078 Abstract | arXiv Analytics

arXiv:2005.10078 [math.DS]Abstract References Reviews Resources

Algebraic Structure and Complexity of Bootstrap Percolation with External Inputs

Published 2020-05-18Version 1

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.

Comments: 10 pages, 5 Figures, Accepted with Minor Changes at Recent Advances in Mathematical and Statistical Methods, Proceedings of AMMCS - 2019

Categories: math.DS, math.GR, nlin.AO

Keywords: external inputs, algebraic structure, complexity, discrete time update rule, standard bootstrap percolation model

Related articles: Most relevant | Search more

arXiv:math/0312042 [math.DS] (Published 2003-12-01)

Measures of $\e$-complexity

V. Afraimovich, L. Glebsky

arXiv:1701.00999 [math.DS] (Published 2017-01-04)

On automorphism groups of Toeplitz subshifts

Sebastián Donoso, Fabien Durand, Alejandro Maass, Samuel Petite

arXiv:1609.04127 [math.DS] (Published 2016-09-14)

Degree Growth of Rational Maps Induced from Algebraic Structures

Charles Favre, Jan-Li Lin