论文信息 - On random mapping patterns

On random mapping patterns

Random mapping patterns may be represented by unlabelled directed graphs in which each point has out-degree one. We determine the asymptotic behaviour of various parameters associated with such graphs, such as the expected number of points belonging to cycles and the expected number of components.

John W. Moon | Amram Meir | J. Moon | A. Meir

[1] Leo Katz,et al. Probability of Indecomposability of a Random Mapping Function , 1955 .

[2] Reinwald Jungen. Sur les séries de Taylor n'ayant que des singularités algébrico-logarithmiques sur leur cercle de convergence , 1931 .

[3] John Riordan,et al. Enumeration of Linear Graphs for Mappings of Finite Sets , 1962 .

[4] R. Otter. The Number of Trees , 1948 .

[5] R. Read. A note on the number of functional digraphs , 1961 .

[6] A. Meir,et al. Path node-covering constants for certain families of trees , 1978 .

[7] B. Harris. PROBABILITY DISTRIBUTIONS RELATED TO RANDOM MAPPINGS , 1960 .

[8] G. Darboux,et al. Mémoire sur l'approximation des fonctions de très-grands nombres, et sur une classe étendue de développements en série. , 1878 .

[9] Fa Dick de Bruijn,et al. Multisets of Aperiodic Cycles , 1982 .

[10] M. Kruskal,et al. The Expected Number of Components Under a Random Mapping Function , 1954 .

[11] J. Moon. Counting labelled trees , 1970 .

[12] F. Harary. The number of functional digraphs , 1959 .