# Network Structure and Activity in Boolean Networks

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 $d$-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.
Keywords :
Document type :
Conference papers
Domain :

https://hal.inria.fr/hal-01442474
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:09:21 PM
Last modification on : Monday, January 23, 2017 - 1:56:58 PM
Long-term archiving on : Friday, April 21, 2017 - 3:50:24 PM

### File

338243_1_En_16_Chapter.pdf
Files produced by the author(s)

### Citation

Abhijin Adiga, Hilton Galyean, Chris Kuhlman, Michael Levet, Henning Mortveit, et al.. Network Structure and Activity in Boolean Networks. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.210-223, ⟨10.1007/978-3-662-47221-7_16⟩. ⟨hal-01442474⟩

Record views