Skip to main content
. 2019 Feb 18;5(2):e01181. doi: 10.1016/j.heliyon.2019.e01181

Figure 7.

Figure 7

Algorithm for the computation of ΦC is illustrated through diagrams. The network ABC (current state = (1,0,0)) constitutes three logic gates: OR, AND, XOR for which the value of ΦC is computed. (i) The network is partitioned into 3 possible atomic bipartitions, (ii) each atomic bipartition is perturbed with a Maximum Entropy Perturbation (MEP) which is a random input binary time series (length = 200) as well as Zero Entropy Perturbation (ZEP) which is a constant sequence (length = 200), (iii) Differential Compression-Complexity is computed by taking the difference between complexities for MEP and ZEP for each output time series from the remaining two unperturbed nodes. This forms the Differential Compression-Complexity Response Distribution (dCCRD) for each bipartition. For example, Image 1, Image 2, represents the dCCRD of the time series obtained from the nodes B and C respectively, when the node A is perturbed. Similarly, the dCCRD for the other two bipartitions are: Image 3, Image 4 and Image 5, Image 6, (iv) the individual values of each dCCRD are summed up to obtain ‘Aggregate Differential Compression-Complexity Measure’ for each bipartitioned-perturbed network. Therefore, Image 7 and similarly Image 8 and Image 9 can be computed. All corresponding values are: Image 10, Image 11, Image 12, (v) Maximal-Aggregate Differential Compression-Complexity, ΦC, is nothing but the maximum of the Aggregate Differential Compression-Complexity measures: Image 13. Thus, Image 14. For more details, please refer to ‘Supplementary Text’.