### Abstract

In this paper we consider a random mapping, T^_{n}, of the finite set {1, 2,..., n} into itself for which the digraph representation G_{n} is constructed by: (1) selecting a random number, L^_{n}, of cyclic vertices, (2) constructing a uniform random forest of size n with the selected cyclic vertices as roots, and (3) forming 'cycles' of trees by applying a random permutation to the selected cyclic vertices. We investigate k^_{n}, the size of a 'typical' component of G_{n}, and, under the assumption that the random permutation on the cyclical vertices is uniform, we obtain the asymptotic distribution of k^_{n} conditioned on L^_{n} = m(n). As an application of our results, we show in Section 3 that provided L^_{n} is of order much larger than vn, then the joint distribution of the normalized order statistics of the component sizes of G_{n} converges to the Poisson-Dirichlet(1) distribution as n ? 8. Other applications and generalizations are also discussed in Section 3.

Original language | English |
---|---|

Pages (from-to) | 341-359 |

Number of pages | 19 |

Journal | Ars Combinatoria |

Volume | 94 |

Publication status | Published - Jan 2010 |

## Fingerprint Dive into the research topics of 'Random mappings with a given number of cyclical points'. Together they form a unique fingerprint.

## Cite this

*Ars Combinatoria*,

*94*, 341-359.