Boolean networks with robust and reliable trajectories

Details Boolean networks with robust and reliable trajectories Boolean networks with robust and reliable trajectories

Nov 2010

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2010njph...12k3054s&link_type=abstract

New Journal of Physics, Volume 12, Issue 11, pp. 113054 (2010).

Physics

2

Scientific paper

We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory.

Affiliated with

Also associated with

No associations

Rating

Boolean networks with robust and reliable trajectories does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Boolean networks with robust and reliable trajectories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boolean networks with robust and reliable trajectories will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1532958