Local negative circuits and fixed points in Boolean networks

Details Local negative circuits and fixed points in Boolean networks Local negative circuits and fixed points in Boolean networks

2009-10-05

arxiv.org/abs/0910.0750v1

Computer Science

Discrete Mathematics

19 pages

Scientific paper

To each Boolean function F from {0,1}^n to itself and each point x in {0,1}^n, we associate the signed directed graph G_F(x) of order n that contains a positive (resp. negative) arc from j to i if the partial derivative of f_i with respect of x_j is positive (resp. negative) at point x. We then focus on the following open problem: Is the absence of a negative circuit in G_F(x) for all x in {0,1}^n a sufficient condition for F to have at least one fixed point? As main result, we settle this problem under the additional condition that, for all x in {0,1}^n, the out-degree of each vertex of G_F(x) is at most one.

Affiliated with

Also associated with

No associations

Rating

Local negative circuits and fixed points 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 Local negative circuits and fixed points in Boolean networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local negative circuits and fixed points in Boolean networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9901