Boolean networks synchronism sensitivity and XOR circulant networks convergence time
Copyright policy )Boolean networks synchronism sensitivity and XOR circulant networks convergence time
In this paper are presented first results of a theoretical study on the role of non-monotone interactions in Boolean automata networks. We propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours according to two axes. The first one consists in supporting the idea that non-monotony has a peculiar influence on the sensitivity to synchronism of such networks. It leads us to the second axis that presents preliminary results and builds an understanding of the dynamical behaviours, in particular concerning convergence times, of specific non-monotone Boolean automata networks called XOR circulant networks.
In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498
- Grenoble Alpes University France
- University of Lyon System France
- DeVry University United States
- Institut Rhônalpin des Systèmes Complexes France
- Jean Moulin University Lyon 3 France
FOS: Computer and information sciences, synchronism sensitivity, Discrete Mathematics (cs.DM), Boolean automata networks, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, [INFO] Computer Science [cs], Computational Complexity (cs.CC), convergence time, Computer Science - Computational Complexity, Electronic computers. Computer science, QA1-939, F.1.2, XOR circulant networks, F.1.3, F.1.1; F.1.2; F.1.3, F.1.1, Mathematics, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, synchronism sensitivity, Discrete Mathematics (cs.DM), Boolean automata networks, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, [INFO] Computer Science [cs], Computational Complexity (cs.CC), convergence time, Computer Science - Computational Complexity, Electronic computers. Computer science, QA1-939, F.1.2, XOR circulant networks, F.1.3, F.1.1; F.1.2; F.1.3, F.1.1, Mathematics, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!