On the length of attractors in boolean networks with an interaction graph by layers
classification
💻 cs.DM
keywords
graphinteractionlengthattractorsbooleannetworkboundcircuit
read the original abstract
We consider a boolean network whose interaction graph has no circuit of length >1. Under this hypothesis, we establish an upper bound on the length of the attractors of the network which only depends on its interaction graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.