Abstract:
The probabilistic characteristics of graph corresponding to the composition of independent uniform random mappings are studied. Exact expressions and estimates for the distribution of distances from vertices to cycles are obtained. Formulas for mean values of numbers of vertices at the given distance from cycles are derived.
Key words:uniform random mapping, composition of mappings, iteration of mapping, graph of a mapping, layer in a graph, cyclic vertices.
Fulltext:
PDF file (496 kB)