Geodesic
On one characteristic of a~random mapping with given number of cycles
Diskretnaya Matematika, Tome 18 (2006) no. 3, pp. 43-60

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the random variable equal to the number of trees of given size in the graph of a random one-to-one mapping of an $n$-element set into itself with $m$ connected components. We obtain limit theorems which describe the distribution of this characteristic in the case where $n\to\infty$, $m/\ln n\to\infty$, $m/\ln n=O(\ln n)$. 
@article{DM_2006_18_3_a2,
     author = {I. A. Cheplyukova},
     title = {On one characteristic of a~random mapping with given number of cycles},
     journal = {Diskretnaya Matematika},
     pages = {43--60},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2006_18_3_a2/}
}
TY  - JOUR
AU  - I. A. Cheplyukova
TI  - On one characteristic of a~random mapping with given number of cycles
JO  - Diskretnaya Matematika
PY  - 2006
SP  - 43
EP  - 60
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2006_18_3_a2/
LA  - ru
ID  - DM_2006_18_3_a2
ER  - 
%0 Journal Article
%A I. A. Cheplyukova
%T On one characteristic of a~random mapping with given number of cycles
%J Diskretnaya Matematika
%D 2006
%P 43-60
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2006_18_3_a2/
%G ru
%F DM_2006_18_3_a2
I. A. Cheplyukova. On one characteristic of a~random mapping with given number of cycles. Diskretnaya Matematika, Tome 18 (2006) no. 3, pp. 43-60. http://geodesic.mathdoc.fr/item/DM_2006_18_3_a2/