Papers › Local negative circuits and cyclic attractors in Boolean networks with at most five components
Local negative circuits and cyclic attractors in Boolean networks with at most five components
Elisa Tonello, Etienne Farcot, Claudine Chaouiya
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We consider the following question on the relationship between the asymptotic behaviours of asynchronous dynamics of Boolean networks and their regulatory structures: does the presence of a cyclic attractor imply the existence of a local negative circuit in the regulatory graph? When the number of model components n verifies n ≥6, the answer is known to be negative. We show that the question can be translated into a Boolean satisfiability problem on n ·2ⁿ variables. A Boolean formula expressing the absence of local negative circuits and a necessary condition for the existence of cyclic attractors is found unsatisfiable for n ≤5. In other words, for Boolean networks with up to $5$ components, the presence of a cyclic attractor requires the existence of a local negative circuit.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections