1Virginia Tech [Blacksburg] (Virginia Polytechnic Institute and State University Blacksburg, VA 24061-0002 - États-Unis)
Abstract : In this paper we extend the notion of activity for Boolean networks introduced by Shmulevich and Kauffman (2004). Unlike the existing notion, we take into account the actual graph structure of the Boolean network. As illustrations, we determine the activity of all elementary cellular automata, and -regular trees and square lattices where the vertex functions are bi-threshold and logical nor functions.The notion of activity measures the probability that a perturbation in an initial state produces a different successor state than that of the original unperturbed state. Apart from capturing sensitive dependence on initial conditions, activity provides a possible measure for the significance or influence of a variable. Identifying the most active variables may offer insight into design of, for example, biological experiments of systems modeled by Boolean networks. We conclude with some open questions and thoughts on directions for future research related to activity.
Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Lecture Notes in Computer Science, LNCS-9099, pp.210-223, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_16〉
https://hal.inria.fr/hal-01442474
Contributeur : Hal Ifip
<>
Soumis le : vendredi 20 janvier 2017 - 16:09:21
Dernière modification le : lundi 23 janvier 2017 - 13:56:58
Document(s) archivé(s) le : vendredi 21 avril 2017 - 15:50:24
Abhijin Adiga, Hilton Galyean, Chris Kuhlman, Michael Levet, Henning Mortveit, et al.. Network Structure and Activity in Boolean Networks. Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Lecture Notes in Computer Science, LNCS-9099, pp.210-223, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_16〉. 〈hal-01442474〉
