On the limit cycle structure of threshold boolean networks over complete graphs

Area of Science:

• Computational biology
• Boolean network analysis
• Graph theory

Background:

• Previous research analyzed limit structures of specific finite threshold boolean networks (TBNs) without inputs over complete digraphs K(n).
• An efficient polynomial-time algorithm was previously developed for computing these structures.

Purpose of the Study:

• To generalize the analysis of limit structures to arbitrary finite threshold boolean networks (TBNs) over K(n).
• To extend the computational algorithm to handle more complex limit structures, including various cycle lengths.

Main Methods:

• Generalization of existing analytical frameworks for TBNs.
• Adaptation of a polynomial-time algorithm for computing network limit structures.
• Extension of the algorithm to symmetric finite boolean networks.

Main Results:

• The limit structure of arbitrary TBNs over K(n) was characterized, encompassing fixed-points and cycles of any length.
• A simple, polynomial-time algorithm was developed for determining these complex limit structures.
• The algorithm was successfully generalized for symmetric finite boolean networks.

Conclusions:

• The study provides a unified and efficient method for analyzing the long-term behavior of a broader class of boolean networks.
• The developed algorithm offers significant computational advantages for understanding complex dynamical systems represented by TBNs.