Finding attractors in asynchronous Boolean dynamics

Details Finding attractors in asynchronous Boolean dynamics Finding attractors in asynchronous Boolean dynamics

2010-08-23

arxiv.org/abs/1008.3851v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

5 pages, 3 figures

Scientific paper

We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph acyclic. In this reduced state transition graph, all attractors are fixed points that can be enumerated with little effort in most instances. This attractor set is then extended to the attractor set of the original dynamics. Our numerical tests on standard Kauffman networks indicate that the method is efficient in the sense that the total number of state vectors visited grows moderately with the number of states contained in attractors.

Affiliated with

Also associated with

No associations

Rating

Finding attractors in asynchronous Boolean dynamics 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 Finding attractors in asynchronous Boolean dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding attractors in asynchronous Boolean dynamics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466060