Sensitivity shows the probability that the output of the Boolean function of a given node changes if its input changes. For random Boolean networks, q i = 2 p i ( 1 − − p i ) . In the general case, stability of the network is governed by the largest eigenvalue λ λ Q of matrix Q , where Q i j = q i A i j , and A is the adjacency matrix of the network. The network is stable if λ λ Q < 1 , critical if λ λ Q = 1 , unstable if λ λ Q > 1 .