On the length of attractors in boolean networks with an interaction graph by layers
Discrete Mathematics
2008-10-31 v1
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.
Cite
@article{arxiv.0810.5482,
title = {On the length of attractors in boolean networks with an interaction graph by layers},
author = {Adrien Richard},
journal= {arXiv preprint arXiv:0810.5482},
year = {2008}
}
Comments
7 pages