Computation of distributions of the numbers of components and cyclic points for random mappings
Matematičeskie voprosy kriptografii, Tome 1 (2010) no. 2, pp. 5-18
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Markov chain based algorithms for the exact computation of distributions of the numbers of components and cyclic points for the random mapping of a finite set into itself and for the iteration of two such mappings are described.
[1] Kolchin V. F., “Odin klass predelnykh teorem dlya uslovnykh raspredelenii”, Lit. matem. sb., 8:1 (1968), 53–63 | MR
[2] Kolchin V. F., Sluchainye otobrazheniya, Nauka, M., 1984 | MR | Zbl
[3] Flajolet P., Odlyzko A. M., “Random mapping statistics”, Lect. Notes Comp. Sci., 434, 1989, 329–354 | MR
[4] Harris B., “A survey of the early history of the theory of random mappings”, Probabilistic Methods in Discrete Mathematics, TVP–VSP, Moscow, 1993, 1–22 | MR | Zbl
[5] Harris B., “Probability distributions related to random mappings”, Ann. Math. Statist., 31:4 (1960), 1045–1062 | DOI | MR | Zbl