Probability, statistics and computation in dynamical systems
From MaRDI portal
Publication:5740360
DOI10.1017/S0960129512000758zbMath1353.37156MaRDI QIDQ5740360
Cristobal Rojas, Isaia Nisoli, Stefano Galatolo
Publication date: 26 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Cramér distance and discretizations of circle expanding maps II: simulations ⋮ Existence of noise induced order, a computer aided proof
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computability of Brolin-Lyubich measure
- On computational complexity of Siegel Julia sets
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
- Complex dynamics
- What are SRB measures, and which dynamical systems have them?
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Invariant sets under iteration of rational functions
- Rigorous numerical investigation of the statistical properties of piecewise expanding maps. A feasibility study
- An improved Monte Carlo factorization algorithm
- Informal Remarks on the Orbit Structure of Discrete Approximations to Chaotic Maps
- On the Approximation of Complicated Dynamical Behavior
- Non-computable Julia sets
- Parabolic Julia sets are polynomial time computable
This page was built for publication: Probability, statistics and computation in dynamical systems