About non-monotony in Boolean automata networks

  • Authors:
  • Mathilde Noual;Damien Regnault;Sylvain Sené

  • Affiliations:
  • Université de Lyon, íNS-Lyon, LIP, CNRS UMR 5668, 69007 Lyon, France and Institut rhône-alpin des systèmes complexes, IXXI, 69007 Lyon, France;Université d'ívry-Val d'Essonne, IBISC, íA 4526, 91000 ívry, France;Université d'ívry-Val d'Essonne, IBISC, íA 4526, 91000 ívry, France and Institut rhône-alpin des systèmes complexes, IXXI, 69007 Lyon, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2013

Quantified Score

Hi-index 5.23

Visualization

Abstract

This paper aims at presenting motivations and first results of a prospective theoretical study on the role of non-monotone interactions in the modelling process of biological regulation networks. Focusing on discrete models of these networks, namely, Boolean automata networks, we propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours. More precisely, in this paper, we start by detailing some motivations, both mathematical and biological, for our interest in non-monotony, and we discuss how it may account for phenomena that cannot be produced by monotony only. Then, to build some understanding in this direction, we show some preliminary results on the dynamical behaviours of some specific non-monotone Boolean automata networks called xor circulant networks.