Robustness and Information Propagation in Attractors of Random Boolean Networks

Content Provider	Semantic Scholar
Author	Lloyd-Price, Jason Gupta, Abhishekh Ribeiro, Andre S.
Copyright Year	2012
Abstract	Attractors represent the long-term behaviors of Random Boolean Networks. We study how the amount of information propagated between the nodes when on an attractor, as quantified by the average pairwise mutual information (I(A)), relates to the robustness of the attractor to perturbations (R(A)). We find that the dynamical regime of the network affects the relationship between I(A) and R(A). In the ordered and chaotic regimes, I(A) is anti-correlated with R(A), implying that attractors that are highly robust to perturbations have necessarily limited information propagation. Between order and chaos (for so-called "critical" networks) these quantities are uncorrelated. Finite size effects cause this behavior to be visible for a range of networks, from having a sensitivity of 1 to the point where I(A) is maximized. In this region, the two quantities are weakly correlated and attractors can be almost arbitrarily robust to perturbations without restricting the propagation of information in the network.
File Format	PDF HTM / HTML
DOI	10.1371/journal.pone.0042018
PubMed reference number	22860048
Journal	Medline
Volume Number	7
Alternate Webpage(s)	http://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0042018&type=printable
Alternate Webpage(s)	https://doi.org/10.1371/journal.pone.0042018
Journal	PloS one
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article