Solution of the inverse frobenius-perron problem for semi-Markov chaotic maps via recursive Markov state disaggregation

Abstract

A novel solution of the inverse Frobenius-Perron problem for constructing semi-Markov chaotic maps with prescribed statistical properties is presented. The proposed solution uses recursive Markov state disaggregation to construct an ergodic map with a piecewise constant invariant density function that approximates an arbitrary probability distribution over a compact interval. The solution is novel in the sense that it provides greater freedom, as compared to existing analytic solutions, in specifying the autocorrelation function of the semi-Markov map during its construction. The proposed solution is demonstrated by constructing multiple chaotic maps with invariant densities that provide an increasingly accurate approximation of the asymmetric beta probability distribution over the unit interval. It is demonstrated that normalised autocorrelation functions with components having different rates of decay and which alternate in sign between consecutive delays may be specified. It is concluded that the flexibility of the proposed solution facilitates its application towards modelling of random signals in various contexts.