Limit cycles and update digraphs in Boolean networks (Q1759857)

The paper begins by introducing Boolean networks iterated under a certain update schedule as well as some basic concepts, and then defines new problem concerning the sharing of limit cycles. It is shown that these and other problems are all NP-hard. In fact, the problem of sharing limit cycles cannot be answered by using only the information contained in the update digraphs. It also explores the possibility that two Boolean networks that differ only in the update schedule can share limit cycles. The paper also gives some sufficient conditions that allow the construction of non-equivalent update schedules which yield a given limit cycle, being strongly dependent on the existence of frozen nodes in the limit cycle.