|
This article is cited in 6 scientific papers (total in 6 papers)
Short Communications
Random mappings of finite sets with a known number of
components
A. N. Timashev Academy of Federal Security Service of Russian Federation
Abstract:
We consider the class of all one-to-one mappings of
an $n$-element set into itself, each of which has exactly $N$
connected components. Letting $n,N\to\infty$, we find
that the asymptotic behavior of the mean and variance of
the random variable is equal to the number of components
of a given size in a mapping that is selected at random and
is equiprobable among the elements of the mentioned class,
and we prove the Poisson and local normal limit theorems
for this random variable. Asymptotic estimates are
found for the number of mappings with $N$ components,
among which there are exactly $k$ components of a fixed
size.
Keywords:
random mapping, local limit theorem, asymptotic estimators, components.
Received: 21.11.2000
Citation:
A. N. Timashev, “Random mappings of finite sets with a known number of
components”, Teor. Veroyatnost. i Primenen., 48:4 (2003), 818–828; Theory Probab. Appl., 48:4 (2004), 741–751
Linking options:
https://www.mathnet.ru/eng/tvp260https://doi.org/10.4213/tvp260 https://www.mathnet.ru/eng/tvp/v48/i4/p818
|
Statistics & downloads: |
Abstract page: | 392 | Full-text PDF : | 196 | References: | 64 |
|