In this paper we consider a random mapping, T̂n, of the finite set {1, 2, ..., n} into itself for which the digraph representation Ĝn is constructed by: (1) selecting a random number, L̂n, of cyclic vertices, (2) constructing a uniform random forest of size n with the selected cyclic vertices as roots, and (3) forming ‘cycles’ of trees by applying a random permutation to the selected cyclic verti...
