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 labelled vertices, and we delete (if possible), uniformly and at random, m non-cyclic directed edges from Gn. The maximal random digraph consisting of the uni-cyclic components obtained after cutting the m edges is called the trimmed rand...