REMARKS ON OPTIMAL INFERENCE FOR MARKOV BRANCHING PROCESSES: A SEQUENTIAL APPROACH

Use of a suitable stopping rule yields exact uniformly most powerful tests and minimum variance unbiased estimators of various parameters of a Markov branching model with or without immigration. The population model discussed includes the pure birth, simple epidemic, immigration-death, M/M/ 1 queue, linear birth-death and a branching diffusion process, among others, as special cases.     

On uniform approximation of Poisson variates by normal ones

In this paper the accuracy of the normal approximation to the Poisson is treated from the viewpoint of direct approximation of Poisson variables by normal ones. The conclusions that are derived on the accuracy of this approximation lead (among others) to very useful results on confidence limits for the mean of a linear combination of independent Poisson variables; these latter are employed in precise determination of the composition of a mixture of radioactive isotopes by means of a scintillation counter.     

On a Pandemic Threshold Theorem of the Early Kermack–McKendrick Model with Individual Heterogeneity

A pandemic threshold theorem of the Kermack–McKendrick epidemic system with individual heterogeneity is proved from the definition of R ₀ by Diekmann, Heesterbeek, and Metz. The early Kermack–McKendrick epidemic model is extended to recognize individual heterogeneity, where the state variable indicates an epidemiological state or genetic, physiological, or behavioral characteristics such as risk of infection. With the basic reproduction number R ₀ for the heterogeneous population, the final size equation of the limit epidemic starting from a completely susceptible steady state at t = ?∞ has a unique positive solution if and only if R ₀  > 1. The main result is that the positive solution of the final size equation gives the lower bound of the intensity of any epidemic starting from a host population composed of susceptible and a few infected individuals who spread on a noncompact domain of the trait variable.     

STEIN'S METHOD AND THE BERRY-ESSÉEN THEOREM

Stein's method is used to prove the Lindeberg-Feller theorem and a generalization of the Berry-Esséen theorem. The arguments involve only manipulation of probability inequalities, and form an attractive alternative to the less direct Fourier-analytic methods which are traditionally employed.     

Likelihood Factorizations for Mixed Discrete and Continuous Variables

Some general remarks are made about likelihood factorizations, distinguishing parameter-based factorizations and concentration-graph factorizations. Two parametric families of distributions for mixed discrete and continuous variables are discussed. Conditions on graphs are given for the circumstances under which their joint analysis can be split into separate analyses, each involving a reduced set of component variables and parameters. The result shows marked differences between the two families although both involve the same necessary condition on prime graphs. This condition is both necessary and sufficient for simplified estimation in Gaussian and for discrete log linear models.     

A brief proof on the generalized variance bound of the relative efficiency in statistics

In this paper, we obtain a brief proof on the generalized varance bound of the relative efficiency that was simultaneously given by Bloomfield and Watson(1975) and by Knott (1975).     

Serial unblocked designs balanced for correlation between neighbours,II

The theory in Part I contained an error that was inferred from the output of a program, written in SAS by Eric P. Smith and David D. Morris. The program produces random BUS designs in accordance with the algorithm of Part I. The theory is here corrected by using a combinatorial argument that involves elementary number theory. The algorithm needs no change but its interpretation is now adjusted.     

On the sample breakdown robustness of some nonparametric tests

In this paper, relying on the sample breakdown points, we investigate the sample breakdown properties of some nonparametric tests. It is shown that the sample breakdown points of the sign test asymptotically dominate those of the Wilcoxon test for one–sided hypotheses, However, the different conclusion is derived in the case of testing some shrinking neighborhood hypotheses. The breakdown behaviors of the Kolmogorov test and X²–test are also explored. These studies unify or refine some existing breakdown analyses of tests.     

PROPERTIES OF THE MINIMUM POINT OF AN UNBALANCED TWO-SIDED RANDOM WALK

In this paper, properties of minimum point of a unbalanced two-sided random walk are investigated. Under the condition that the parameters at both sides tend to zero at the same order, probabilities that the minimum point is on which side, and the second order expansions for the first two moments of the minimum point are obtained. Applications of these results are very promising. First, they can be used to study the properties of the maximum likelihood estimator for the change point in the large sample case; second, they can be used to study inference problems after CUSUM test.     

D-Optimum Designs for Optimum Mixture in a Quadratic Log Contrast Model

Optimal designs for estimating the optimum mixing proportions in a quadratic mixture model was first investigated by Pal and Mandal (2006). In this article, similar investigation is carried out when mean response in a mixture experiment is described by a quadratic log contrast model. It is found that in a symmetric subspace of the finite dimensional simplex, there exists a D-optimal design that puts weights at the centroid of the sub-space and the vertices of the experimental domain. The optimality is checked by numerical computation using Equivalence Theorem.