Boolean network sensitivity measures

[bcdaniels]

As defined in

Shmulevich, I., & Kauffman, S. A. (2004). Activities and sensitivities in Boolean network models. Physical Review Letters, 93(4), 48701–1. http://doi.org/10.1103/PhysRevLett.93.048701

1. In a synchronous network, the sensitivity of a Boolean function f on state vector x is the number of Hamming neighbors of x on which the function value is different than on x. What is the analogous quantity for asynchronous networks, where the output of f is a distribution over states? Probably a KL-divergence would work, but this still requires some thought...
2. The average sensitivity is defined by taking the expectation of the sensitivity with respect to a distribution over states x.

[dglmoore]

I think this and issue #40 are both addressed by #71. @bcdaniels What do you think?

[bcdaniels]

The point of this issue was to extend the sensitivity analysis to asynchronous networks—but that will require more thought. (We were thinking that asynchronous stuff would wait for version 0.2.0...)

[bcdaniels]

I believe we are now arguing that the same sensitivity measure should be informative for both synchronous and asynchronous networks, in which case this is no longer necessary. Right?