arXiv · 1712.01407
Iteration entropy
Abstract
We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to \log_2(n) minus the entropy of the vector of its cycle lengths. For general functions, a similar approximation holds.
Explore related subjects
Keep this discovery
Joachim von zur Gathen. 2017-12-04. Iteration entropy. https://arxiv.org/abs/1712.01407
Cite the original work for its findings. Save a collection to share your selection of sources.