RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2006 Volume 18, Issue 3, Pages 43–60 (Mi dm58)

This article is cited in 2 papers

On one characteristic of a random mapping with given number of cycles

I. A. Cheplyukova


Abstract: 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)$.

UDC: 519.2

Received: 14.03.2005

DOI: 10.4213/dm58


 English version:
Discrete Mathematics and Applications, 2006, 16:5, 479–497

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025