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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jason Lloyd-Price, Abhishekh Gupta, Andre S Ribeiro
Formato:	article
Lenguaje:	EN
Publicado:	Public Library of Science (PLoS) 2012
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/953a7075165c4dd0a7285be49c307768
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:953a7075165c4dd0a7285be49c307768
record_format	dspace
spelling	oai:doaj.org-article:953a7075165c4dd0a7285be49c3077682021-11-18T07:10:24ZRobustness and information propagation in attractors of Random Boolean Networks.1932-620310.1371/journal.pone.0042018https://doaj.org/article/953a7075165c4dd0a7285be49c3077682012-01-01T00:00:00Zhttps://www.ncbi.nlm.nih.gov/pmc/articles/pmid/22860048/?tool=EBIhttps://doaj.org/toc/1932-6203Attractors 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.Jason Lloyd-PriceAbhishekh GuptaAndre S RibeiroPublic Library of Science (PLoS)articleMedicineRScienceQENPLoS ONE, Vol 7, Iss 7, p e42018 (2012)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Jason Lloyd-Price Abhishekh Gupta Andre S Ribeiro Robustness and information propagation in attractors of Random Boolean Networks.
description	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.
format	article
author	Jason Lloyd-Price Abhishekh Gupta Andre S Ribeiro
author_facet	Jason Lloyd-Price Abhishekh Gupta Andre S Ribeiro
author_sort	Jason Lloyd-Price
title	Robustness and information propagation in attractors of Random Boolean Networks.
title_short	Robustness and information propagation in attractors of Random Boolean Networks.
title_full	Robustness and information propagation in attractors of Random Boolean Networks.
title_fullStr	Robustness and information propagation in attractors of Random Boolean Networks.
title_full_unstemmed	Robustness and information propagation in attractors of Random Boolean Networks.
title_sort	robustness and information propagation in attractors of random boolean networks.
publisher	Public Library of Science (PLoS)
publishDate	2012
url	https://doaj.org/article/953a7075165c4dd0a7285be49c307768
work_keys_str_mv	AT jasonlloydprice robustnessandinformationpropagationinattractorsofrandombooleannetworks AT abhishekhgupta robustnessandinformationpropagationinattractorsofrandombooleannetworks AT andresribeiro robustnessandinformationpropagationinattractorsofrandombooleannetworks
_version_	1718423867687436288

Robustness and information propagation in attractors of Random Boolean Networks.

Ejemplares similares