Core percolation and onset of complexity in Boolean networks

Details Core percolation and onset of complexity in Boolean networks Core percolation and onset of complexity in Boolean networks

2004-12-16

arxiv.org/abs/cond-mat/0412443v3

Phys. Rev. Lett. 96, 018101 (2006)

Physics

Condensed Matter

Disordered Systems and Neural Networks

major revisions, extended results, version accepted for publication in PRL

Scientific paper

10.1103/PhysRevLett.96.018101

The determination and classification of fixed points of large Boolean networks is addressed in terms of constraint satisfaction problem. We develop a general simplification scheme that, removing all those variables and functions belonging to trivial logical cascades, returns the computational core of the network. The onset of an easy-to-complex regulatory phase is introduced as a function of the parameters of the model, identifying both theoretically and algorithmically the relevant regulatory variables.

Affiliated with

Also associated with

No associations

Rating

Core percolation and onset of complexity in Boolean networks 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 Core percolation and onset of complexity in Boolean networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Core percolation and onset of complexity in Boolean networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-628394