Redundancy and error resilience in Boolean Networks
classification
⚛️ physics.bio-ph
cond-mat.stat-mechnlin.CG
keywords
networksnoisebooleanerroralwayscapableconsidercritical
read the original abstract
We consider the effect of noise in sparse Boolean Networks with redundant functions. We show that they always exhibit a non-zero error level, and the dynamics undergoes a phase transition from non-ergodicity to ergodicity, as a function of noise, after which the system is no longer capable of preserving a memory if its initial state. We obtain upper-bounds on the critical value of noise for networks of different sparsity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.