Strata of random mappings – A combinatorial approach

Consider the functional graph of a random mapping from an n-element set into itself. Then the number of nodes in the strata of this graph can be viewed as stochastic process. Using a generating function approach it is shown that a suitable normalization of this process converges weakly to local time of reflecting Brownian bridge.