Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHow to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable
115
0
0.0
(
0
)
Added by
Cristobal Rojas
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We consider the simplest non-linear discrete dynamical systems, given by the logistic maps $f_{a}(x)=ax(1-x)$ of the interval $[0,1]$. We show that there exist real parameters $ain (0,4)$ for which almost every orbit of $f_a$ has the same statistical distribution in $[0,1]$, but this limiting distribution is not Turing computable. In particular, the Monte Carlo method cannot be applied to study these dynamical systems.
rate research
Read More
This article is devoted to study which conditions imply that a topological dynamical system is mean sensitive and which do not. Among other things we show that every uniquely ergodic, mixing system with positive entropy is mean sensitive. On the other hand we provide an example of a transitive system which is cofinitely sensitive or Devaney chaotic with positive entropy but fails to be mean sensitive. As applications of our theory and examples, we negatively answer an open question regarding equicontinuity/sensitivity dichotomies raised by Tu, we introduce and present results of locally mean equicontinuous systems and we show that mean sensitivity of the induced hyperspace does not imply that of the phase space.
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
It is shown that any non-PI minimal system is Li-Yorke sensitive. Consequently, any minimal system with nontrivial weakly mixing factor (such a system is non-PI) is Li-Yorke sensitive, which answers affirmatively an open question by Akin and Kolyada.
Kolmogorov complexity is the length of the ultimately compressed version of a file (that is, anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the incomputabilty of Kolmogorov complexity, which formal loopholes this leaves us, recent approaches to compute or approximate Kolmogorov complexity, which approaches are problematic and which approaches are viable.
We characterize a stochastic dynamical system with tempered stable noise, by examining its probability density evolution. This probability density function satisfies a nonlocal Fokker-Planck equation. First, we prove a superposition principle that the probability measure-valued solution to this nonlocal Fokker-Planck equation is equivalent to the martingale solution composed with the inverse stochastic flow. This result together with a Schauder estimate leads to the existence and uniqueness of strong solution for the nonlocal Fokker-Planck equation. Second, we devise a convergent finite difference method to simulate the probability density function by solving the nonlocal Fokker-Planck equation. Finally, we apply our aforementioned theoretical and numerical results to a nonlinear filtering system by simulating a nonlocal Zakai equation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
