  We study decomposable combinatorial labeled structures in the exp-log class,
specifically, two examples of type a=1 and two examples of type a=1/2. Our
approach is to establish how well existing theory matches experimental data.
For instance, the median length of the longest cycle in a random n-permutation
is (0.6065...)*n, whereas the median length of the largest component in a
random n-mapping is (0.7864...)*n. Unsolved problems are highlighted, in the
hope that someone else might address these someday.
