Bifurcations in Boolean Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2011

Bifurcations in Boolean Networks

Abstract

This paper characterizes the attractor structure of synchronous and asynchronous Boolean networks induced by bi-threshold functions. Bi-threshold functions are generalizations of standard threshold functions and have separate threshold values for the transitions $0 \rightarrow $1 (up-threshold) and $1 \rightarrow 0$ (down-threshold). We show that synchronous bi-threshold systems may, just like standard threshold systems, only have fixed points and 2-cycles as attractors. Asynchronous bi-threshold systems (fixed permutation update sequence), on the other hand, undergo a bifurcation. When the difference $\Delta$ of the down- and up-threshold is less than 2 they only have fixed points as limit sets. However, for $\Delta \geq 2$ they may have long periodic orbits. The limiting case of $\Delta = 2$ is identified using a potential function argument. Finally, we present a series of results on the dynamics of bi-threshold systems for families of graphs.
Fichier principal
Vignette du fichier
dmAP0103.pdf (469.59 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01196142 , version 1 (09-09-2015)

Identifiers

Cite

Chris J. Kuhlman, Henning S. Mortveit, David Murrugarra, Anil V. S. Kumar. Bifurcations in Boolean Networks. 17th International Workshop on Celular Automata and Discrete Complex Systems, 2011, Santiago, Chile. pp.29-46, ⟨10.46298/dmtcs.2975⟩. ⟨hal-01196142⟩

Collections

TDS-MACS
112 View
674 Download

Altmetric

Share

Gmail Facebook X LinkedIn More