Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
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


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. 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


Files downloads