Cooperative Boolean systems with generically long attractors I

DOI10.1080/10236198.2012.691167MaRDI QIDQ5301058zbMATH OpenOpenAlexFDO

Authors Winfried Just, Maciej Malicki

Publication date 2 July 2013

Published in Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.3008

zbMATH Keywords

Boolean networkschaotic dynamicscooperative systemslong attractors

Mathematics Subject Classification ID

Decentralized systems (93A14) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Abstract: We study the class of cooperative Boolean networks whose only regulatory functions are COPY, binary AND, and binary OR. We prove that for all sufficiently large N and c < 2 there exist Boolean networks in this class that have an attractor of length > c^N whose basin of attraction comprises an arbitrarily large fraction of the state space. The existence of such networks contrasts with results on various other types of dynamical systems that show nongenericity or absence of non-steady state attractors under the assumption of cooperativity.

Recommendations

• Cooperative Boolean systems with generically long attractors. II
• Ordered dynamics in biased and cooperative Boolean networks
• Bifurcations in Boolean Networks
• Attractors in coherent systems of differential equations
• Attractors in Boolean networks: a tutorial

Cites work

• Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems
• Cooperative Boolean systems with generically long attractors. II
• scientific article; zbMATH DE number 758785 (Why is no real title available?)
• Lattice Theoretic Properties of Frontal Switching Functions
• Nontrivial lower bounds for the least common multiple of some finite sequences of integers
• On limit cycles of monotone functions with symmetric connection graph
• Prevalent behavior of strongly order preserving semiflows
• Sorting in \(c \log n\) parallel steps
• Stability and convergence in strongly monotone dynamical systems.

Cited in

(10)

• Ordered dynamics in biased and cooperative Boolean networks
• Cooperative Boolean systems with generically long attractors. II
• Complexity of fixed point counting problems in Boolean networks
• Exponentially long orbits in Boolean networks with exclusively positive interactions
• Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems
• scientific article; zbMATH DE number 18054 (Why is no real title available?)
• Attractor stability in nonuniform Boolean networks
• Dynamics of sparse Boolean networks with multi-node and self-interactions
• Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
• The maximal coordination principle in regulatory Boolean networks

This page was built for publication: Cooperative Boolean systems with generically long attractors I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301058)