Efficient heterogeneous sampling for stochastic simulation with an illustration in health care applications

In modeling disease transmission, contacts are assumed to have different infection rates. A proper simulation must model the heterogeneity in the transmission rates. In this article, we present a computationally efficient algorithm that can be applied to a population with heterogeneous transmission rates. We conducted a simulation study to show that the algorithm is more efficient than other algorithms for sampling the disease transmission in a subset of the heterogeneous population. We use a valid stochastic model of pandemic influenza to illustrate the algorithm and to estimate the overall infection attack rates of influenza A (H1N1) in a Canadian city.     

Reversible jump Markov chain Monte Carlo algorithms for Bayesian variable selection in logistic mixed models

In this article, to reduce computational load in performing Bayesian variable selection, we used a variant of reversible jump Markov chain Monte Carlo methods, and the Holmes and Held (HH) algorithm, to sample model index variables in logistic mixed models involving a large number of explanatory variables. Furthermore, we proposed a simple proposal distribution for model index variables, and used a simulation study and real example to compare the performance of the HH algorithm with our proposed and existing proposal distributions. The results show that the HH algorithm with our proposed proposal distribution is a computationally efficient and reliable selection method.     

Kumaraswamy Marshall-Olkin Exponential distribution

In this paper, a new generalization of the Kumaraswamy distribution namely, the Kumaraswamy Marshall-Olkin Exponential distribution (KwMOE) is introduced and studied. Various properties are explored. The structural analysis includes various aspects such as limiting behaviour, shape properties, moments, quantiles, mean deviation, Renyi entropy, order statistics and stochastic ordering. Some useful characterizations of the family are also obtained. The method of maximum likelihood is used to estimate the model parameters. Monte Carlo simulation study is being conducted. An application to a real data set is presented for illustrative purposes.     

Estimation of error probabilities in stochastic dominance

The process of using data to infer the existence of stochastic dominance is subject to sampling error. Kroll and Levy (1980), among others, have presented simulation results for several normal and lognormal distributions which show high error probabilities for a wide range of parameter values. This paper continues this line of research and uses simulation to estimate error probabilities. Distributions considered are a pair of normals and a pair of lognormals. Analysis of these distributions is made computationally feasible through theoretical results which reduce the number of parameters of the pair of distributions from four to two.     

General standby allocation in series and parallel systems

Stochastic orders are very useful tools to compare the lifetimes of two systems. Optimum lifetime of a series (resp. parallel) system with general standby component(s) depends on the allocation strategy of standby component(s) into the system. Here, we discuss three different models of one or more standby components. In each model, we compare different series (resp. parallel) systems (which are formed through different allocation strategies of standby component(s)) with respect to the usual stochastic order and the stochastic precedence order. The results related to the cold as well as the hot standby models are obtained as particular cases of the results discussed in this article because the model considered here is a general one.     

Adaptive stochastic gradient boosting tree with composite criterion

ABSTRACT

In this paper, we propose an adaptive stochastic gradient boosting tree for classification studies with imbalanced data. The adjustment of cost-sensitivity and the predictive threshold are integrated together with a composite criterion into the original stochastic gradient boosting tree to deal with the issues of the imbalanced data structure. Numerical study shows that the proposed method can significantly enhance the classification accuracy for the minority class with only a small loss in the true negative rate for the majority class. We discuss the relation of the cost-sensitivity to the threshold manipulation using simulations. An illustrative example of the analysis of suboptimal health-state data in traditional Chinese medicine is discussed.     

Ordering results for series and parallel systems comprising heterogeneous exponentiated Weibull components

In this paper, we discuss the usual stochastic and reversed hazard rate orders between the series and parallel systems from two sets of independent heterogeneous exponentiated Weibull components. We also obtain the results concerning the convex transform orders between parallel systems and obtain necessary and sufficient conditions under which the dispersive and usual stochastic orders, and the right spread and increasing convex orders between the lifetimes of the two systems are equivalent. Finally, in the multiple-outlier exponentiated Weibull models, based on weak majorization and p-larger orders between the vectors of scale and shape parameters, some characterization results for comparing the lifetimes of parallel and series systems are also established, respectively. The results of this paper can be used in practical situations to find various bounds for the important aging characteristics of these systems.     

COST-VOLUME-PROFIT ANALYSIS IN STOCHASTIC PROGRAMMING MODELS

This paper applies mathematical programming to cost-volume-profit (CVP) analysis under contribution margin uncertainty. Three CVP probabilistic chance-constraint models based on various safety-first criteria for decisions under uncertainty are presented and compared. It is shown that a break-even segment of the mean-standard deviation frontier is a set of optimal solutions for the proposed models. An operational parametric quadratic programming (QP) model is constructed, and the efficiency frontier is generated. The procedures for locating an optimal solution on the efficiency frontier are then presented. The recommended QP procedure offers both technical relief from the computational difficulties posed by the probabilistic constraints and a desired flexibility in generating and presenting the relevant information for decisions under uncertainty.