Limit cycles and update digraphs in Boolean networks
type: Item
instance of: scholarly article
title: Limit cycles and update digraphs in Boolean networks
zbMATH Open document ID: 1254.05062
author: Xianqiang Yang
published in: Discrete Applied Mathematics
publication date: 2012-11-22T00:00:00Z
review text: The paper begins by introducing Boolean networks iterated under a certain update schedule as well as some basic concepts, and then defines new problem concerning the sharing of limit cycles. It is shown that these and other problems are all NP-hard. In fact, the problem of sharing limit cycles cannot be answered by using only the information contained in the update digraphs. It also explores the possibility that two Boolean networks that differ only in the update schedule can share limit cycles. The paper also gives some sufficient conditions that allow the construction of non-equivalent update schedules which yield a given limit cycle, being strongly dependent on the existence of frozen nodes in the limit cycle.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 6109926
zbMATH Keywords: Boolean network
zbMATH Keywords: update schedule
zbMATH Keywords: robustness
zbMATH Keywords: update digraph
zbMATH Keywords: limit cycle
zbMATH Keywords: frozen node
MaRDI profile type: Publication
full work available at URL: j.dam.2012.07.003
OpenAlex ID: W1999736765
DOI: 10.1016/J.DAM.2012.07.003
description: scientific article; zbMATH DE number 6109926