On the preservation of limit cycles in Boolean networks under different updating schemes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Boolean networks under different deterministic updating schemes are analyzed. It is direct to show that fixed points are invariant against changes in the updating scheme, nevertheless, it is still an open problem to fully understand what happens to the limit cycles. In this paper, a theorem is presented which gives a sufficient condition for a Boolean network not to share the same limit cycle under different updating modes. We show that the hypotheses of the theorem are sharp, in the sense that if any of these hypotheses do not hold, then shared limit cycles may appear. We find that the connectivity of the network is an important factor as well as the Boolean functions in each node, in particular the XOR functions.

Original languageEnglish
Title of host publicationProceedings of the 12th European Conference on the Synthesis and Simulation of Living Systems
Subtitle of host publicationAdvances in Artificial Life, ECAL 2013
PublisherMIT Press Journals
Pages1085-1090
Number of pages6
ISBN (Electronic)9780262317092
DOIs
StatePublished - 2013
Externally publishedYes
Event12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013 - Sicily, Italy
Duration: 2 Sep 20136 Sep 2013

Publication series

NameProceedings of the 12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013

Conference

Conference12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013
Country/TerritoryItaly
CitySicily
Period2/09/136/09/13

Fingerprint

Dive into the research topics of 'On the preservation of limit cycles in Boolean networks under different updating schemes'. Together they form a unique fingerprint.

Cite this