Abstract
Let
Note: Originally published in Diskretnaya Matematika (2015) 27,
Funding source: Russian Science Foundation
Award Identifier / Grant number: 14-50-00005
Funding statement: This work was supported by the Russian Science Foundation under grant no. 14-50-00005
References
[1] Kolchin V.F., Random mappings, Optimization Software Inc. Publications Division, N.Y., 1986, 207 pp.Search in Google Scholar
[2] Kolchin V. F., Sevastyanov B. A., Chistyakov V. P., Random allocations, V. H. Winston & Sons, Washington, 1978, 262 pp.Search in Google Scholar
[3] Gantmacher F.R., The Theory of Matrices, 1, 2, Chelsea Publishing Company. NewYork, 1959, vol. 1: x+374 pp., vol. 2: x+277 pp.Search in Google Scholar
[4] Zubkov A. M., Serov A. A., “Images of subset of finite set under iterations of random mappings”, Discrete Math. Appl., 25:3 (2015), 179–185.10.1515/dma-2015-0017Search in Google Scholar
[5] Stepanov V. E., “On the distribution of the number of vertices in strata of a random tree”, Theory Probab. Appl., 14:1 (1969), 64–77.10.1137/1114007Search in Google Scholar
[6] Dalal A., Schmutz E. “Compositions of random functions on a finite set”, Electr. J. Comb., 9:R26 (2002).10.37236/1642Search in Google Scholar
[7] Flajolet P., Odlyzko A. M., “Random mapping statistics”, Lect. Notes Comput. Sci., 434, 1990, 329–354.10.1007/3-540-46885-4_34Search in Google Scholar
[8] Goh W. M. Y., Hitczenko P., Schmutz E., “Iterating random functions on a finite set”, 2014, 7 pp., arXiv: arXiv:math/0207276v2.Search in Google Scholar
[9] Kingman J. F. C., “The coalescent”, Stoch.Proc. Appl., 13 (1982), 235–248.10.1016/0304-4149(82)90011-4Search in Google Scholar
© 2016 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Research Article
- Finite automata and numbers
- Research Article
- On coincidences of tuples in a binary tree with random labels of vertices
- Research Article
- On elementary word functions obtained by bounded prefix concatenation
- Research Article
- Functions without short implicents. Part II: Construction
- Research Article
- Images of a finite set under iterations of two random dependent mappings
- Research Article
- Extinction of decomposable branching processes
Articles in the same Issue
- Research Article
- Finite automata and numbers
- Research Article
- On coincidences of tuples in a binary tree with random labels of vertices
- Research Article
- On elementary word functions obtained by bounded prefix concatenation
- Research Article
- Functions without short implicents. Part II: Construction
- Research Article
- Images of a finite set under iterations of two random dependent mappings
- Research Article
- Extinction of decomposable branching processes