Layers of the graph of $k$-fold iteration of the uniform random mapping

The probabilistic characteristics of the graph of $k$-fold iteration of uniform random mapping are studied. Exact expressions and estimates for the distribution of the distances from the vertices to cycles are obtained. Formulas for expected values of the numbers of vertices on the given distance from cycles and for the distribution function of the height of a random vertex are derived.