Iterating random functions on a finite set
classification
🧮 math.CO
math.PR
keywords
functionscardinalitychosencompositionconstantdistributionfindfinite
read the original abstract
Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is constant. We find the limiting distribution of T/n, as n --> infinity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.