Large Components and Trees of Random Mappings

Ljuben Mutafchiev, Steven Finch

Let ${\mathcal{T}}_n$ be the set of all mappings $T:[n]\to [n]$, where $[n]=\{1,2,\dots ,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoin…