Published in

Elsevier, Advances in Applied Mathematics, 3(41), p. 335-350, 2008

DOI: 10.1016/j.aam.2007.11.003

Links

Tools

Export citation

Search in Google Scholar

Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework

Journal article published in 2008 by Elisabeth Remy, Paul Ruet, Denis Thieffry
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

To each Boolean function f : {0, 1}^n → {0, 1}^n and each x ∈ {0, 1}^n, we associate a signed directed graph G(x), and we show that the existence of a positive circuit in G(x) for some x is a necessary condition for the existence of several fixed points in the dynamics (the sign of a circuit being defined as the product of the signs of its edges), and that the existence of a negative circuit is a necessary condition for the existence of an attractive cycle. These two results are inspired by rules for discrete models of genetic regulatory networks proposed by the biologist R. Thomas. The proof of the first result is modelled after a recent proof of the discrete Jacobian conjecture.