This article is cited in 1 scientific paper (total in 1 paper)
Collisions and incidence of vertices and components in the graph of $k$-fold iteration of the uniform random mapping
V. O. Mironkin
National Research University "Higher School of Economics", Moscow
The probabilistic characteristics of the graph of $k$-fold iteration of uniform random mapping are studied. Formulas for the distribution of the length of the aperiodicity segment of a arbitrary vertex with some restrictions are calculated. Exact expressions for the probability of belonging of two arbitrary vertices to a single connected component, of hitting by a arbitrary vertex the preimage set of another vertex and of occurrence of a collision in such graph are obtained.
uniform random mapping, iteration of random mapping, aperiodicity segment, graph of a mapping, connected component, preimage, collision.
PDF file (480 kB)
First page: PDF file
V. O. Mironkin, “Collisions and incidence of vertices and components in the graph of $k$-fold iteration of the uniform random mapping”, Diskr. Mat., 31:4 (2019), 38–52
Citation in format AMSBIB
\paper Collisions and incidence of vertices and components in the graph of $k$-fold iteration of the uniform random mapping
\jour Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. O. Mironkin, “Sloi v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 11:1 (2020), 101–114
|Number of views:|