%0 Conference Proceedings
%T Network Structure and Activity in Boolean Networks
%+ Virginia Tech [Blacksburg]
%A Adiga, Abhijin
%A Galyean, Hilton
%A Kuhlman, Chris, J.
%A Levet, Michael
%A Mortveit, Henning, S.
%A Wu, Sichao
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%Y Jarkko Kari
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9099
%P 210-223
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_16
%K Boolean networks
%K Finite dynamical system
%K Activity
%K Sensitivity
%K Network
%K Sensitive dependence on initial conditions
%Z Computer Science [cs]Conference papers
%X 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 <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>d</mi></math>-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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442474/document
%2 https://inria.hal.science/hal-01442474/file/338243_1_En_16_Chapter.pdf
%L hal-01442474
%U https://inria.hal.science/hal-01442474
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA