Perturbing the Bernoulli shift map in binary systems: Researchers effectively tune the parameters of a perturbation method to preserve chaos in the Bernoulli shift map output

Is it possible for a deterministic system to be unpredictable? Although counter-intuitive, the answer is yes. Such systems are called “chaotic systems,” which are characterized by sensitive dependence on initial conditions and long-term unpredictability. The behavior of such systems is often described using what is known as a “chaotic map.” Chaotic maps finds applications in areas such as algorithm design, data analysis, and numerical simulations.

One well-known example of a chaotic map is the Bernoulli shift map. In practical applications of the Bernoulli shift map, the outputs are often required to have long periods. Strangely enough, however, when the Bernoulli shift map is implemented in a binary system, such as a digital computer, the output sequence is no longer chaotic and instead converges to zero!

To this end, perturbation methods are an effective strategy where a disturbance is applied to the state of the Bernoulli shift map to prevent its output from converging. However, the choice of parameters for obtaining suitable perturbations lacks a theoretical underpinning.

In a recent study made available online on October 21, 2022 and published in Volume 165, Part 1 of the journal Chaos, Solitons & Fractals on December 2022, Professor Tohru Ikeguchi from the Tokyo University of Science in association with Dr. Noriyoshi Sukegawa from University of Tsukuba, both in Japan, have now addressed this issue, laying the theoretical foundations for effective parameter tuning. “While numerical simulations can tell us which values of the parameters can prevent convergence, there is no theoretical background for choosing these values. In this paper, we aimed to investigate the theoretical support be hind this choice,” explains Prof. Ikeguchi.

Accordingly, the researchers made use of modular arithmetic to tune a dominant parameter in the perturbation method. In particular, they defined the best value for the parameter, which depended on the bit length specified in implementations. The team further analyzed the output period for which the parameter had the best value. Their findings showed that the resulting periods came close to the trivial theoretical upper bounds. Based on this, the researchers obtained a complete list of the best parameter values for a successful implementation of the Bernoulli shift map.

Additionally, an interesting consequence of their investigation was its relation to Artin’s conjecture on primitive roots, an open question in number theory. The researchers suggested that, provided Artin’s conjecture were true, their approach would be theoretically guaranteed to be effective for any bit length.

Overall, the theoretical foundations put forth in this research are of paramount importance in the practical applications of chaotic maps in general. “A notable advantage of our approach is that it provides a theoretical support to the choice of best parameters. In addition, our analysis can also be partially applied to other chaotic maps, such as the tent map and the logistic map,” highlights Dr. Sukegawa.

With distinct advantages, such as simplicity and ease of implementation, the Bernoulli shift maps is highly desirable in several practical applications. And, as this study shows, sometimes chaos is preferable to order!

Story Source:

Materials provided by Tokyo University of Science. Note: Content may be edited for style and length.