Efficient sequential estimation in a markov branching process with immigration

Sequential estimation of parameters In a continuous time Markov branching process with Immigration with split rate λ₁ Immigration rate λ₂, offspring distribution {p₁j≥O) and Immigration distribution {p₂j≥l} is considered. A sequential version of the Cramér-Rao type information inequality is derived which gives a lower bound on the variances of unbiased estimators for any function of these parameters. Attaining the lower bounds depends on whether the sampling plan or stopping rule S, the estimator f, and the parametric function g = E(f) are efficient. All efficient triples (S,f,g) are characterized; It Is shown that for i = 1,2, only linear combinations of λ_ip_{ij j}'s or their ratios are efficiently estimable. Applications to a Yule process, a linear birth and death process with immigration and an M/M/∞ queue are also considered