Efficient $$\hbox {SMC}^2$$ schemes for stochastic kinetic models

Fitting stochastic kinetic models represented by Markov jump processes within the Bayesian paradigm is complicated by the intractability of the observed-data likelihood. There has therefore been considerable attention given to the design of pseudo-marginal Markov chain Monte Carlo algorithms for such models. However, these methods are typically computationally intensive, often require careful tuning and must be restarted from scratch upon receipt of new observations. Sequential Monte Carlo (SMC) methods on the other hand aim to efficiently reuse posterior samples at each time point. Despite their appeal, applying SMC schemes in scenarios with both dynamic states and static parameters is made difficult by the problem of particle degeneracy. A principled approach for overcoming this problem is to move each parameter particle through a Metropolis-Hastings kernel that leaves the target invariant. This rejuvenation step is key to a recently proposed \(\hbox {SMC}^2\) algorithm, which can be seen as the pseudo-marginal analogue of an idealised scheme known as iterated batch importance sampling. Computing the parameter weights in \(\hbox {SMC}^2\) requires running a particle filter over dynamic states to unbiasedly estimate the intractable observed-data likelihood up to the current time point. In this paper, we propose to use an auxiliary particle filter inside the \(\hbox {SMC}^2\) scheme. Our method uses two recently proposed constructs for sampling conditioned jump processes, and we find that the resulting inference schemes typically require fewer state particles than when using a simple bootstrap filter. Using two applications, we compare the performance of the proposed approach with various competing methods, including two global MCMC schemes.     

Some new lower bounds to various discrepancies on combined designs

The foldover is a useful technique in construction of two-level factorial designs. A foldover design is the follow-up experiment generated by reversing the sign(s) of one or more factors in the initial design. The full design obtained by joining the runs in the foldover design to those of the initial design is called the combined design. In this article, some new lower bounds of various discrepancies of combined designs, such as the centered, symmetric, and wrap-around L₂-discrepancies, are obtained, which can be used as a better benchmark for searching optimal foldover plans. Our results provide a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

The variable parameters T ^{2} chart with run rules

The Hotelling’s \(\textit{T}^{2 }\) control chart with variable parameters (VP \(T^{2})\) has been shown to have better statistical performance than other adaptive control schemes in detecting small to moderate process mean shifts. In this paper, we investigate the statistical performance of the VP \(T^{2}\) control chart coupled with run rules. We consider two well-known run rules schemes. Statistical performance is evaluated by using a Markov chain modeling the random shock mechanism of the monitored process. The in-control time interval of the process is assumed to follow an exponential distribution. A genetic algorithm has been designed to select the optimal chart design parameters. We provide an extensive numerical analysis indicating that the VP \(T^{2}\) control chart with run rules outperforms other charts for small sizes of the mean shift expressed through the Mahalanobis distance.     

Impact of measurement errors on the performance and distributional properties of the multivariate capability index $$\mathbf{NMC }_\mathbf{pm }$$

Current industrial processes are sophisticated enough to be tied to only one quality variable to describe the process result. Instead, many process variables need to be analyze together to assess the process performance. In particular, multivariate process capability analysis (MPCIs) has been the focus of study during the last few decades, during which many authors proposed alternatives to build the indices. These measures are extremely attractive to people in charge of industrial processes, because they provide a single measure that summarizes the whole process performance regarding its specifications. In most practical applications, these indices are estimated from sampling information collected by measuring the variables of interest on the process outcome. This activity introduces an additional source of variation to data, that needs to be considered, regarding its effect on the properties of the indices. Unfortunately, this problem has received scarce attention, at least in the multivariate domain. In this paper, we study how the presence of measurement errors affects the properties of one of the MPCIs recommended in previous researches. The results indicate that even little measurement errors can induce distortions on the index value, leading to wrong conclusions about the process performance.     

A discrepancy bound for deterministic acceptance-rejection samplers beyond $$N^{-1/2}$$ in dimension 1

In this paper we consider an acceptance-rejection (AR) sampler based on deterministic driver sequences. We prove that the discrepancy of an N element sample set generated in this way is bounded by \(\mathcal {O} (N^{-2/3}\log N)\), provided that the target density is twice continuously differentiable with non-vanishing curvature and the AR sampler uses the driver sequence \(\mathcal {K}_M= \{( j \alpha , j \beta ) ~~ mod~~1 \mid j = 1,\ldots ,M\},\) where \(\alpha ,\beta \) are real algebraic numbers such that \(1,\alpha ,\beta \) is a basis of a number field over \(\mathbb {Q}\) of degree 3. For the driver sequence \(\mathcal {F}_k= \{ ({j}/{F_k}, \{{jF_{k-1}}/{F_k}\} ) \mid j=1,\ldots , F_k\},\) where \(F_k\) is the k-th Fibonacci number and \(\{x\}=x-\lfloor x \rfloor \) is the fractional part of a non-negative real number x, we can remove the \(\log \) factor to improve the convergence rate to \(\mathcal {O}(N^{-2/3})\), where again N is the number of samples we accepted. We also introduce a criterion for measuring the goodness of driver sequences. The proposed approach is numerically tested by calculating the star-discrepancy of samples generated for some target densities using \(\mathcal {K}_M\) and \(\mathcal {F}_k\) as driver sequences. These results confirm that achieving a convergence rate beyond \(N^{-1/2}\) is possible in practice using \(\mathcal {K}_M\) and \(\mathcal {F}_k\) as driver sequences in the acceptance-rejection sampler.     

Lower bound of average centered L2-discrepancy for U-type designs

Uniform designs are widely used in various scientific investigations and industrial applications. By considering all possible level permutation of the factors, a connection between average centered L₂-discrepancy and generalized wordlength pattern for asymmetrical fractional factorial designs is derived. Moreover, we present new lower bounds to the average centered L₂-discrepancy for symmetrical and asymmetrical U-type designs. For illustration of the theoretical results, the lower bounds for symmetrical and asymmetrical U-type designs are tabulated, and numerical results indicate that our lower bounds behave well and can be recommended for use in practice.     

A note on the representation of {E\left({\textit{\textbf {x}}}\otimes {\textit{\textbf {xx}}}^{\prime}\right) } and {E\left({\textit{\textbf {xx}}}^{\prime }\otimes {\textit{\textbf {xx}}}^{\prime }\right)} for the random vector x

In this paper we consider ${E(x\otimes xx^{\prime})}$ and ${E(xx^{\prime }\otimes xx^{\prime})}$ for a random vector x where x _i has existing moments up to the fourth order and where the higher moments may depend on i. This extends previous results which assumed a common higher moment and E(xx??)?=?I.     

Chain graph models: topological sorting of meta-arrows and efficient construction of $${\mathcal{B}}$$ -essential graphs

Essential graphs and largest chain graphs are well-established graphical representations of equivalence classes of directed acyclic graphs and chain graphs respectively, especially useful in the context of model selection. Recently, the notion of a labelled block ordering of vertices was introduced as a flexible tool for specifying subfamilies of chain graphs. In particular, both the family of directed acyclic graphs and the family of “unconstrained” chain graphs can be specified in this way, for the appropriate choice of . The family of chain graphs identified by a labelled block ordering of vertices is partitioned into equivalence classes each represented by means of a -essential graph. In this paper, we introduce a topological ordering of meta-arrows and use this concept to devise an efficient procedure for the construction of -essential graphs. In this way we also provide an efficient procedure for the construction of both largest chain graphs and essential graphs. The key feature of the proposed procedure is that every meta-arrow needs to be processed only once.     

Families of neighbour designs and their analysis

Several methods of construction of generalised neighbour designs of equal and unequal block sizes are presented alongwith examples. Some methods for constructing neighbour designs of Rees are also given. The outline of analysis of generalised neighbour design has also been suggested.     

Estimation of a distribution function by extrapolating upper and lower bounds

Constrained optimization is proposed as a practical solution to the problem of estimating a distribution function at each point in a given set from monotone sequences of upper and lower bounds. The proposed solution employs least absolute value estimation and, hence, has a linear programming formulation. The special structure inherent in this formulation is exploited and an efficient computational method is discussed. The procedure is illustrated by two examples.     

Some extensions of circular balanced and circular strongly balanced repeated measurements designs

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences, and psychology. In this paper the works of Iqbal and Tahir (2009 Iqbal, I., and M. H. Tahir. 2009. Circular strongly balanced repeated measurements designs. Communications in Statistics—Theory and Methods 38:3686–96.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) and Iqbal, Tahir, and Ghazali (2010 Iqbal, I., M. H. Tahir, and S. S. A. Ghazali. 2010. Circular first- and second-order balanced repeated measurements designs. Communications in Statistics—Theory and Methods 39:228–40.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) are generalized for the construction of circular-balanced and circular strongly balanced repeated measurements designs through the method of cyclic shifts for three periods.     

Some results on coverings of galois spaces with ovoids and related bib designs

Some different coverings of Galois planes with ovoids are obtained and a three-dimensional example is also introduced. The regularity of these structures is put in evidence by constructing related BIB designs.     

Upper and lower bounds for the correlation ratio of order statistics from a sample without replacement

Using properties of the Hahn Polynomials, we give upper and lower bounds for the correlation ratio between order statistics of a sample without replacement from a finite population. The upper bound is attained when the population contains a lattice set. Except for particular cases, the lower bound is not sharp.     

A new lower bound to A2-optimality measure for multi-level and mixed-level column balanced designs and its applications

In this paper, a new lower bound to A₂-optimality measure is derived and is applied to multi-level and mixed-level column balanced designs. A₂-optimal multi-level and mixed-level designs are obtained by the application of the new lower bound.     

A characterization of some {3v1 + v3, 3v0 + v2; 3, 3}-minihypers and its applications to error-correcting codes

Recently, Hamada et al. (Des. Codes Cryptogr. 2(1992), 225–229) showed that there exists an [87,5,57;3]-code meeting the Grismer bound. But it is unknown whether or not an [87,5,57;3]-code is unique up to equivalence. In order to characterize all [87,5,57;3]-codes, it is sufficient to characterize all {2v₂ + 2v₃,2v₁ + 2v₂; 4, 3}-minihypers and in order to characterize all {2v₂ + 2v₃,2v₁ + 2v₂;4,3}-minihypers, it is necessary to characterize all {3v₁ + v₃,3v₀ + v₂;3,3}-minihypers, where v₀ = 0, v₁ = 1, v₂ = 4 and v₃ = 13 (cf. Hamada and Helleseth, J. Statist. Plann. Inference, 56 (1996)). The purpose of this paper is to characterize all {3v₁ + v₃,3v₀ + v₂;3,3}-minihypers.     

Some measures of kurtosis and their inference on large datasets

AStA Advances in Statistical Analysis - This paper deals with the estimation of kurtosis on large datasets. It aims at overcoming two frequent limitations in applications: first, Pearson's...     

Some optimal block designs with nested rows and columns for research on alternative methods of limiting slug damage

Some criteria of optimality of a block design with nested rows and columns are considered. The criteria are based on the eigenvalues of the information matrix C or on the eigenvalues of the matrix C with respect to a diagonal matrix R of treatment replications. New constructions of some optimal block designs with nested rows and columns are presented for application to special plant protection experiments.