Abstract: For random maps, the expected value of the order (i.e. the period of the sequence of compositional iterates) is approximated asymptotically. It is much smaller than the expected value for the product of the cycle lengths.
Recommendations
Cites work
- A functional central limit theorem for random mappings
- A Rate for the Erdős-Turán Law
- Explicit Tauberian estimates for functions with positive coefficients
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3081798 (Why is no real title available?)
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations
- On some problems of a statistical group-theory. III
- Probability Distributions Related to Random Mappings
- Some combinatorial properties of transformations and their connections with the theory of graphs
- The asymptotic distribution of the order of elements in symmetric semigroups
- The Expected order of a Random Permutation
Cited in
(7)- Compositions of random functions on a finite set
- How the period of a function can be found?
- scientific article; zbMATH DE number 50128 (Why is no real title available?)
- Periods of iterations of functions with restricted preimage sizes
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- On improvements of ther-adding walk in a finite field of characteristic 2
- Periods of iterated rational functions
This page was built for publication: Period Lengths for Iterated Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081333)
