Sequential-depletion removal sampling: latent abundance
N_i ~ Poisson(lambda_i) (or negative binomial) observed through K ordered
removal passes, where pass k removes
Binomial(N_i - sum_{l<k} y_{il}, p_{ik}) of the individuals still present.
The declining catch sequence identifies detection p and abundance N; the
latent N is summed out in closed form (truncation K_max), so the fit is a
direct Laplace approximation (no EM), with a NUTS path over the same marginal.
Usage
removal(K_max = NULL, mixture = c("poisson", "negbin"))Arguments
- K_max
upper bound for the latent-abundance marginal sum (the exact integration over
Nis truncated atK_max).NULL(default) lets the engine pickmax(y) + 100(matchingunmarked::pcount()); raise it if a fit warns that the posterior overNputs mass on the boundary.- mixture
latent-abundance distribution, both fitted via tulpa's closed-form marginal Laplace engine.
"poisson"is the default;"negbin"(negative binomial,Var(N) = lambda + lambda^2 / r) adds an overdispersion parameterr. Non-spatially the log sizelog_ris estimated jointly with the coefficients and reported with an SE; on the areal-spatial path (method = "nested_laplace")ris integrated over the outer hyperparameter grid and reported as a posterior mean / sd. Namedmixture(afterunmarked::pcount()) to avoid collision with the model-typefamilyargument oftobs().
Details
The tobs() formula is the abundance (log lambda) model; detection is
the per-pass detection (logit p) model. The response y is an
n_sites x K integer matrix of per-pass removals with the passes in column
order; complete pass sequences are required (no NA).