{'fraction_non_alphanumeric': 0.009077155824508321, 'fraction_numerical': 0.0, 'mean_word_length': 5.12962962962963, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Stochastic Model of Self-Stabilizing Cellular Automata for Consensus Formation

In this paper we present a model of the dynamics of an interesting class of stochastic cellular automata. Such automata are variants of automata used for density classification and they are chosen because they can be effectively used to address consensus problems. After introducing the topic and the basic notation, we study the dynamics of such automata by means of simulations with varying periods and neighborhood structures. We use the results of simulations to extrapolate a stochastic model of the dynamics of such automata that can be used to estimate stabilization time.