Tests whether an episodic recruitment record can be the delayed
consequence of a reproductive record, under any distributed lag. A delay
is a convolution, and a convolution is a weighted average, so the
concentration in time of expected recruitment can never exceed that of
reproduction: reproduction's own concentration is a ceiling. The package
computes that ceiling by searching families of lag weights (pure delays,
windows, geometric decay and Dirichlet draws), calibrates the pooled
comparison against negative-binomial counts to show what it can and
cannot refute, and runs the host-level (replicate-unit) test in which the
null is the lag hypothesis exactly as it is asserted: expected
recruitment on each unit is that unit's own lagged reproduction, scaled to
its own total. Uncertainty on the exceedance comes by three routes, a
cluster bootstrap over units, a Bayesian bootstrap (Rubin 1981