Iterations of random and deterministic functions
From MaRDI portal
Let \(f\) be a probability generating function on \([0,1]\). Various theorems concerning the convergence of the iterates \(f_ n\) of \(f\) to fixed points as \(n\to\infty\) are stated. No proofs are given. The results include rates for \(f\) and \(f^{-1}\). Iterates of independent identically distributed stable processes are studied and a trichotomy based on the order of the stability is established.
Recommendations
Cites work
Cited in
(15)- Almost sure convergence for iterated functions of independent random variables
- Sieving random iterative function systems
- Generalized Cantor functions: random function iteration
- On beta distributed limits of iterated linear random functions
- The growth of iterates of multivariate generating functions
- Modified Iteration and Probability
- scientific article; zbMATH DE number 4043835 (Why is no real title available?)
- scientific article; zbMATH DE number 1223058 (Why is no real title available?)
- Some characteristics of sequences of iterations with random perturbations
- Koenigs function and fractional iterates of probability generating functions
- scientific article; zbMATH DE number 2109413 (Why is no real title available?)
- Preservation conditions for infinite integer sequence iterated generating function schemes
- Random iteration with place dependent probabilities
- Time-dependent iteration of random functions
- Study of the iterations of a mapping associated to a spin glass model
This page was built for publication: Iterations of random and deterministic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322378)