# A cutting process for random mappings

Jennie C. Hansen, Jerzy Jaworski

Research output: Contribution to journalArticle

4 Citations (Scopus)

### Abstract

In this paper we consider a cutting process for random mappings. Specifically, for 0 < m < n, we consider the initial (uniform) random mapping digraph Gn on n labeled vertices, and we delete (if possible), uniformly and at random, m noncyclic directed edges from G n. The maximal random digraph consisting of the unicyclic components obtained after cutting the m edges is called the trimmed random mapping and is denoted by Gnm. If the number of noncyclic directed edges is less than m, then Gnm consists of the cycles, including loops, of the initial mapping Gn. We consider the component structure of the trimmed mapping Gnm. In particular, using the exact distribution we determine the asymptotic distribution of the size of a typical random connected component of Gnm as n, m ? 8. This asymptotic distribution depends on the relationship between n and m and we show that there are three distinct cases: (i) m = o(vn), (ii) m = ß vn, where ß > 0 is a fixed parameter, and (iii) vn = o(m). This allows us to study the joint distribution of the order statistics of the normalized component sizes of Gnm. When m = o(vn), we obtain the Poisson-Dirichlet(1/2) distribution in the limit, whereas when vn = o(m) the limiting distribution is Poisson-Dirichlet(1). Convergence to the Poisson-Dirichlet(?) distribution breaks down when m = O(vn), and in particular, there is no smooth transition from the PD(1/2) distribution to the PD(1) via the Poisson-Dirichlet distribution as the number of edges cut increases relative to n, the number of vertices in Gn. © 2006 Wiley Periodicals, Inc.

Original language English 287-306 20 Random Structures and Algorithms 30 1-2 https://doi.org/10.1002/rsa.20159 Published - Jan 2007

### Keywords

• Component structure
• Poisson-Dirichlet distribution
• Random mappings