  We give a general framework for approximations to combinatorial assemblies,
especially suitable to the situation where the number $k$ of components is
specified, in addition to the overall size $n$. This involves a Poisson
process, which, with the appropriate choice of parameter, may be viewed as an
extension of saddlepoint approximation.
  We illustrate the use of this by analyzing the component structure when the
rank and size are specified, and the rank, $r := n-k$, is small relative to
$n$. There is near-universal behavior, in the sense that apart from cases where
the exponential generating function has radius of convergence zero, for
$\ell=1,2,\dots$, when $r \asymp n^\alpha$ for fixed $\alpha \in
(\frac{\ell}{\ell+1}, \frac{\ell+1}{\ell+2})$, the size $L_1$ of the largest
component converges in probabiity to $\ell+2$. Further, when $r \sim t\,
n^{\ell/(\ell+1)}$ for a positive integer $\ell$, and $t \in (0,\infty)$,
$\mathbb{P}\,(L_1 \in \{\ell+1,\ell+2\}) \to 1$, with the choice governed by a
Poisson limit distribution for the number of components of size $\ell+2$. This
was previously observed, for the case $\ell=1$ and the special cases of
permutations and set partitions, using Chen-Stein approximations for the
indicators of attacks and alignments, when rooks are placed randomly on a
triangular board. The case $\ell=1$ is especially delicate, and was not handled
by previous saddlepoint approximations.
