On the length of attractors in boolean networks with an interaction graph by layers

Simple item page
dc.creatorRichard, Adrien
dc.date2008-10-30
dc.date.accessioned2026-07-07T10:14:11Z
dc.date.available2026-07-07T10:14:11Z
dc.descriptionWe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0810.5482
dc.identifierhttp://arxiv.org/abs/0810.5482
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172793
dc.subjectDiscrete Mathematics
dc.titleOn the length of attractors in boolean networks with an interaction graph by layers
dc.typetext

Files

Collections

arXiv