Random mappings with component sizes from a given set
Teoriâ veroâtnostej i ee primeneniâ, Tome 64 (2019) no. 3, pp. 599-609
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper is concerned with single-valued mappings from the set of $n$
labeled elements into itself such that the sizes of connected
components of the graph corresponding to each mapping lie in a given countable set of
positive integers. We find the asymptotic behavior for the number of all such
mappings as $n\to\nobreak \infty$. As a conjecture, we formulate sufficient
conditions for the convergence of the distribution of the number of
components in a random equiprobable mapping of the above form to the normal
law (in the local setting). We consider particular cases where this
conjecture applies and derive corollaries from it. Conditions are given for the
convergence of the distribution of the number of components of a given size to
a Poisson distribution law.
Keywords:
random mappings, components, saddle-point method, power series, asymptotic density.
Mots-clés : Poisson distribution
Mots-clés : Poisson distribution
@article{TVP_2019_64_3_a11,
author = {A. N. Timashev},
title = {Random mappings with component sizes from a given set},
journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
pages = {599--609},
publisher = {mathdoc},
volume = {64},
number = {3},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TVP_2019_64_3_a11/}
}
A. N. Timashev. Random mappings with component sizes from a given set. Teoriâ veroâtnostej i ee primeneniâ, Tome 64 (2019) no. 3, pp. 599-609. http://geodesic.mathdoc.fr/item/TVP_2019_64_3_a11/