On the limit cycle structure of threshold boolean networks over complete graphs
Related Experiment Video
Updated: Aug 23, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
Published on: December 7, 2021
1School of Mathematics and Computer Science, Lake Superior State University, 650 W. Easterday Avenue, Sault Sainte Marie, MI 49783, USA.
Abstract:
In previous work, the limit structure of positive and negative finite threshold boolean networks without inputs (TBNs) over the complete digraph K(n) was analyzed and an algorithm was presented for computing this structure in polynomial time. Those results are generalized in this paper to cover the case of arbitrary TBNs over K(n). Although the limit structure is now more complicated, containing, not only fixed-points and cycles of length 2, but possibly also cycles of arbitrary length, a simple algorithm is still available for its determination in polynomial time. Finally, the algorithm is generalized to cover the case of symmetric finite boolean networks over K(n).
Related Concept Videos
Network Function of a Circuit
Limits with Oscillating Discontinuities
Types of Limits I
Circuit Terminology
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.
BIBO stability of continuous and discrete -time systems
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system.
The Squeeze Theorem