Robustness and information propagation in attractors of Random Boolean Networks.

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 f...

Full description

Bibliographic Details
Main Authors: Jason Lloyd-Price, Abhishekh Gupta, Andre S Ribeiro
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2012-01-01
Series:PLoS ONE
Online Access:https://www.ncbi.nlm.nih.gov/pmc/articles/pmid/22860048/?tool=EBI