Information fluctuation complexity

Information fluctuation complexity is an information-theoretic quantity defined as the fluctuation of information about entropy. It is derivable from fluctuations in the predominance of order and chaos in a dynamic system and has been used as a measure of complexity in many diverse fields. It was introduced in a 1993 paper by Bates and Shepard.

Definition

The information fluctuation complexity of a discrete dynamic system is a function of the probability distribution of its states when it is subject to random external input data. The purpose of driving the system with a rich information source such as a random number generator or a white noise signal is to probe the internal dynamics of the system in much the same way as a frequency-rich impulse is used in signal processing.

If a system has $N$ possible states and the state probabilities $p_{i}$ are known, then its information entropy is

$\mathrm {H} =\sum _{i=1}^{N}p_{i}I_{i}=-\sum _{i=1}^{N}p_{i}\log p_{i},$

where ${\textstyle I_{i}=-\log p_{i}}$ is the information content of state $i$.

The information fluctuation complexity of the system is defined as the standard deviation or fluctuation of $I$ about its mean $\mathrm {H}$:

$\sigma _{I}={\sqrt {\sum _{i=1}^{N}p_{i}(I_{i}-\mathrm {H} )^{2}}}={\sqrt {\sum _{i=1}^{N}p_{i}I_{i}^{2}-\mathrm {H} ^{2}}}$

or

$\sigma _{I}={\sqrt {\sum _{i=1}^{N}p_{i}\log ^{2}p_{i}-{\Biggl (}\sum _{i=1}^{N}p_{i}\log p_{i}{\Biggr )}^{2}}}.$

The fluctuation of state information $\sigma _{I}$ is zero in a maximally disordered system with all ${\textstyle p_{i}={\frac {1}{N}}}$; the system simply mimics its random inputs. $\sigma _{I}$ is also zero if the system is perfectly ordered with only one fixed state ${\textstyle (p_{1}=1)}$, regardless of the inputs. $\sigma _{I}$ is non-zero between these two extremes with a mixture of higher-probability states and lower-probability states populating state space.

Fluctuation of information allows for memory and computation

As a complex dynamic system evolves over time, how it transitions between states depends on external stimuli in an irregular way. At times it may be more sensitive to external stimuli (unstable) and at other times less sensitive (stable). When a given state has multiple possible next-states, external information determines which one will be next and the system gains this information by following a particular trajectory in state space. However, if several different states all lead to the same next-state, then upon entering the next-state the system loses information about which state preceded it. Thus, a complex system exhibits alternating information gain and loss as it evolves over time. This alternation or fluctuation of information is equivalent to remembering and forgetting — temporary information storage or memory — an essential feature of non-trivial computation.

The gain or loss of information associated with transitions between states can be related to state information. The net information gain of a transition from state $i$ to state $j$ is the information gained when leaving state $i$ less the information lost when entering state $j$:

$\Gamma _{ij}=-\log p_{i\rightarrow j}+\log p_{i\leftarrow j}.$

Here ${\textstyle p_{i\rightarrow j}}$ is the forward conditional probability that if the present state is $i$ then the next state will be $j$ and ${\textstyle p_{i\leftarrow j}}$ is the reverse conditional probability that if the present state is $j$ then the previous state was $i$. The conditional probabilities are related to the transition probability $p_{ij}$, the probability that a transition from state $i$ to state $j$ occurs, by:

$p_{ij}=p_{i}p_{i\rightarrow j}=p_{i\leftarrow j}p_{j}.$

Eliminating the conditional probabilities:

$\Gamma _{ij}=-\log(p_{ij}/p_{i})+\log(p_{ij}/p_{j})=\log p_{i}-\log p_{j}=I_{j}-I_{i}.$

Therefore, the net information gained by the system as a result of the transition depends only on the increase in state information from the initial to the final state. It can be shown that this is true even for multiple consecutive transitions.

${\textstyle \Gamma =\Delta I}$ is reminiscent of the relation between force and potential energy. $I$ is like potential $\Phi$ and $\Gamma$ is like force $\mathbf {F}$ in ${\textstyle \mathbf {F} ={\nabla \Phi }}$. External information "pushes" a system "uphill" to a state of higher information potential to accomplish information storage, much like pushing a mass uphill to a state of higher gravitational potential stores energy. The amount of energy stored depends only on the final height, not on the path up the hill. Similarly, the amount of information stored does not depend on the transition path between an initial common state and a final rare state. Once a system reaches a rare state with high information potential, it may then "fall" back to a common state, losing previously stored information.

It may be useful to compute the standard deviation of $\Gamma$ about its mean (which is zero), namely the fluctuation of net information gain $\sigma _{\Gamma }$, but $\sigma _{I}$ takes into account multi-transition memory loops in state space and therefore should be more indicative of the computational power of a system. Moreover, $\sigma _{I}$ is easier to apply because there can be many more transitions than states.

Chaos and order

A dynamic system that is sensitive to external information (unstable) exhibits chaotic behavior whereas one that is insensitive to external information (stable) exhibits orderly behavior. A complex system exhibits both behaviors, fluctuating between them in dynamic balance when subject to a rich information source. The degree of fluctuation is quantified by $\sigma _{I}$; it captures the alternation in the predominance of chaos and order in a complex system as it evolves over time.

Example: rule 110 variant of the elementary cellular automaton

Source:

The rule 110 variant of the elementary cellular automaton has been proven to be capable of universal computation. The proof is based on the existence and interactions of cohesive and self-perpetuating cell patterns known as gliders, which are examples of emergent phenomena associated with complex systems and which imply the capability of groups of automaton cells to remember that a glider is passing through them. It is therefore to be expected that there will be memory loops in state space resulting from alternations of information gain and loss, instability and stability, chaos and order.

Consider a 3-cell group of adjacent automaton cells that obey rule 110: end-center-end. The next state of the center cell depends on the present state of itself and the end cells as specified by the rule:

Elementary cellular automaton rule 110

3-cell group	1-1-1	1-1-0	1-0-1	1-0-0	0-1-1	0-1-0	0-0-1	0-0-0
next center cell	0	1	1	0	1	1	1	0

To compute the information fluctuation complexity of this system, attach a driver cell to each end of the 3-cell group to provide random external stimuli like so, driver→end-center-end←driver, such that the rule can be applied to the two end cells. Next, determine what the next state will be for each possible present state and for each possible combination of driver cell contents, in order to determine the forward conditional probabilities.

The state diagram of this system is depicted below, with circles representing states and arrows representing transitions between states. The eight possible states of this system, 1-1-1 to 0-0-0, are labeled with the octal equivalent of the 3-bit contents of the 3-cell group: 7 to 0. The transition arrows are labeled with forward conditional probabilities. Notice that there is variability in the divergence and convergence of arrows corresponding to variability in gain and loss of information originating from the driver cells.

The 3-cell state diagram for the rule 110 elementary cellular automaton showing forward conditional transition probabilities with random stimulation.

The forward conditional probabilities are determined by the proportion of possible driver cell contents that drive a particular transition. For example, for the four possible combinations of two driver cell contents, state 7 leads to states 5, 4, 1 and 0 and therefore ${\textstyle p_{7\rightarrow 5}}$, ${\textstyle p_{7\rightarrow 4}}$, ${\textstyle p_{7\rightarrow 1}}$, and ${\textstyle p_{7\rightarrow 0}}$ are each 1⁄4 or 25%. Similarly, state 0 leads to states 0, 1, 0 and 1 and therefore ${\textstyle p_{0\rightarrow 1}}$ and ${\textstyle p_{0\rightarrow 0}}$ are each 1⁄2 or 50%. And so forth.

The state probabilities are related by

$p_{j}=\sum _{i=0}^{7}p_{i}p_{i\rightarrow j}$ and $\sum _{i=0}^{7}p_{i}=1.$

These linear algebraic equations can be solved for the state probabilities, with the following results:

Rule 110 state probabilities for 3-cell automaton with random stimulation

p0	p1	p2	p3	p4	p5	p6	p7
⁠2/17⁠	⁠2/17⁠	⁠1/34⁠	⁠5/34⁠	⁠2/17⁠	⁠2/17⁠	⁠2/17⁠	⁠4/17⁠

The information entropy and the complexity can then be computed from the state probabilities:

$\mathrm {H} =-\sum _{i=0}^{7}p_{i}\log _{2}p_{i}=2.86{\text{ bits}},$

$\sigma _{I}={\sqrt {\sum _{i=0}^{7}p_{i}\log _{2}^{2}p_{i}-\mathrm {H} ^{2}}}=0.56{\text{ bits}}.$

Note that the maximum possible entropy for eight states is $3{\text{ bits}}$, which is the case when all ${\textstyle p_{i}={\frac {1}{8}}}$. Thus, rule 110 has a relatively high entropy or state utilization of $2.86{\text{ bits}}$. However, this does not preclude a considerable fluctuation of state information about entropy and thus a considerable value of the complexity. Whereas, maximum entropy would preclude complexity.

An alternative method can be used to obtain the state probabilities when the analytical method used above is unfeasible. Simply drive the system at its inputs (the driver cells) with a random source for many generations and observe the state probabilities empirically. When this is done via computer simulation for 10 million generations the results are as follows:

Information variables for the rule 110 elementary cellular automaton

number of cells	3	4	5	6	7	8	9	10	11	12	13
$\mathrm {H}$ (bits)	2.86	3.81	4.73	5.66	6.56	7.47	8.34	9.25	10.09	10.97	11.78
$\sigma _{I}$(bits)	0.56	0.65	0.72	0.73	0.79	0.81	0.89	0.90	1.00	1.01	1.15
$\sigma _{I}/\mathrm {H}$	0.20	0.17	0.15	0.13	0.12	0.11	0.11	0.10	0.10	0.09	0.10

Since both $\mathrm {H}$ and $\sigma _{I}$ increase with system size, their dimensionless ratio $\sigma _{I}/\mathrm {H}$, the relative information fluctuation complexity, is included to compare systems of different sizes. Notice that the empirical and analytical results agree for the 3-cell automaton and that the relative complexity levels off to about $0.10$ by 10 cells.

In the paper by Bates and Shepard, $\sigma _{I}$ is computed for all elementary cellular automaton rules and it was observed that the ones that exhibit slow-moving gliders and possibly stationary objects, as rule 110 does, are highly correlated with large values of $\sigma _{I}$. $\sigma _{I}$ can therefore be used as a filter to select candidate rules for universal computation, which is challenging to prove.

Applications

Although the derivation of the information fluctuation complexity formula is based on information fluctuations in dynamic systems, the formula depends only on state probabilities and therefore is also applicable to any probability distribution, including those derived from static images or text.

Over the years the original paper has been referred to by researchers in many diverse fields: complexity theory, complex systems science, complex networks, chaotic dynamics, many-body localization entanglement, environmental engineering, ecological complexity, ecological time-series analysis, ecosystem sustainability, air and water pollution, hydrological wavelet analysis, soil water flow, soil moisture, headwater runoff, groundwater depth, air traffic control, flow patterns and flood events, topology, economics, market forecasting of metal and electricity prices, health informatics, human cognition, human gait kinematics, neurology, EEG analysis, education, investing, artificial life and aesthetics.