Complex stochastic Boolean systems, depending on a large number n of statistically independent random Boolean variables, appear in many different scientific, technical or social areas. Each one of the 2n binary states associated to such systems is denoted by its corresponding binary n-tuple of 0s and 1s, , and it has a certain occurrence probability . The ordering between the 2n binary n-tuple probabilities, , can be illustrated by a directed graph which “scales” them by decreasing order, the so-called intrinsic order graph. In this context, this paper provides a simple algorithm for iteratively drawing the intrinsic order graph, for any complex stochastic Boolean system and for any number n of independent random Boolean variables. The presentation is self-contained.
展开▼
