A Berry-Esseen theorem for hypergeometric probabilities under minimal conditions

In this paper, we consider simple random sampling without replacement from a dichotomous finite population and derive a necessary and sufficient condition on the finite population parameters for a valid large sample Normal approximation to Hypergeometric probabilities. We then obtain lower and upper bounds on the difference between the Normal and the Hypergeometric distributions solely under this necessary and sufficient condition.

     

An improved exponential estimator of finite population mean in simple random sampling using an auxiliary attribute

In this paper, we propose an exponential ratio type estimator of the finite population mean when auxiliary information is qualitative in nature. Under simple random sampling without replacement scheme, the expressions for the bias and the mean square error of the proposed estimator have been obtained, up to first order of approximation. To show that our proposed estimator is more efficient as compared to the existing estimators, we have made a comparative study with respect to their mean square errors. Theoretically and numerically, we have found that our proposed estimator is always more efficient as compared to its competitor estimators including all the estimators of Abd-Elfattah et al. [1] [A.M. Abd-Elfattah, E.A. El-Sherpieny, S.M. Mohamed, and O.F. Abdou. Improvement in estimating the population mean in simple random sampling using information on auxiliary attribute. Applied Mathematics and Computation, 215 (2010), 4198-4202].     

一种满足有效样本量固定的放回抽样方法

相比不放回抽样,放回抽样的实施比较简单,操作性强,但缺点在于单元可能被重复抽到,抽出的有效样本量小于等于样本量,不是固定的。本文应用逆抽样的原理,设计了一种放回抽样方法,满足有效样本量固定,并且估计量的性质优良。     

Random sampling within the framework of a multivariate principal-agent approach

In this paper, we analyze a specific class of principal-agent models which seems to be sufficiently general to cover applications in environmental economics with upstream-downstream problems as an example. In our basic model, the observation outcome is ann-dimensional random vectorx and only the first and second moments ofx are common knowledge. We study the effects of random sampling in the presence of costly signals. For this purpose, we assume that the principal and the agent use a simple statistical procedure, i.e. their contract will be based on the mean of a random sample with sampling costs dependent on the sample size. It is shown that there exists an optimal sample size. We investigate the relationship between the optimal sample size, the marginal sampling costs, and the agent's risk aversion.     

A robust alternative to the ratio estimator under non-normality

In sampling theory, the traditional ratio estimator is the most common estimator of the population mean when the correlation between study and auxiliary variables is positively high. We introduce a new ratio-type estimator based on the order statistics of a simple random sample. We show that this new estimator is considerably more efficient than the traditional ratio estimator under non-normality, and remarkably robust to data anomalies such as presence of outliers in data sets.     

山东省城镇劳动就业与社会保障抽样调查方案设计

为了解城镇劳动就业与社会保障有关情况,山东省劳动和社会保障厅拟在全省城镇开展抽样调查。本文提出分层三阶段PPS随机抽样设计,给出确定各阶段样本量的原则和方法,构造了按与人口规模成比例的概率的抽样方法及与之相匹配的估计量,讨论了估计量方差的估计。     

A new resampling method for sampling designs without replacement: the doubled half bootstrap

A new and very fast method of bootstrap for sampling without replacement from a finite population is proposed. This method can be used to estimate the variance in sampling with unequal inclusion probabilities and does not require artificial populations or utilization of bootstrap weights. The bootstrap samples are directly selected from the original sample. The bootstrap procedure contains two steps: in the first step, units are selected once with Poisson sampling using the same inclusion probabilities as the original design. In the second step, amongst the non-selected units, half of the units are randomly selected twice. This procedure enables us to efficiently estimate the variance. A set of simulations show the advantages of this new resampling method.     

一种可供选择的随机化调查方法

本文提出了一种新的随机化调查方法,Warner(1965)和Horvitz,Simmons(1967)随机化回答方法是本文方法的特殊情形.这一方法比Warner(1965)方法和Mangat(1990)方法更有效. 当考虑存在不真实回答时,在一定的条件下并且不损失对个体保护度和不增加调查成本的前提下,提出的方法优于Simmons(1967)方法和Sarjinder Singh(2000)方法.对简单随机不放回抽样,在总体非敏感属性个体比例未知的情况下,给出了两个子样本容量的最优配置.     

在分层抽样下有效利用辅助信息及含于层总体大小中的信息的经验似然方法

本文考虑用在分层随机抽样下的经验似然方法来获得有限总体参数的估计量\bd 我们指出, 经验似然方法非常自然地结合辅助信息和含于层总体大小中的信息\bd 我们的结果显示, 由经验似然方法可获得有效估计.     

Dependence Between Order Statistics in Samples from Finite Population and its Application to Ranked Set Sampling

Let X1, X2,..., Xm, Y1, Y2,..., Yn be a simple random sample without replacement from a finite population and let X(1) X(2) ... X(m) and Y(1) Y(2) ... Y(n) be the order statistics of X1, X2,..., Xm and Y1, Y2,..., Yn, respectively. It is shown that the joint distribution of X(i) and X(j) is positively likelihood ratio dependent and Y(j) is negatively regression dependent on X(i). Using these results, it is shown that when samples are drawn without replacement from a finite population, the relative precision of the ranked set sampling estimator of the population mean, relative to the simple random sample estimator with the same number of units quantified, is bounded below by 1.     

Sequential Fixed-Width Confidence Interval for the Product of Two Means

For the product of two population means, the problem of constructing a fixed-width confidence interval with preassigned coverage probability is considered. It is shown that the optimal sample sizes which minimize the total sample size and at the same time guarantee a fixed-width confidence interval of desired coverage depend on the unknown parameters. In order to overcome this, a fully sequential procedure consisting of a sampling scheme and a stopping rule are proposed. It is then shown that the sequential confidence interval is asymptotically consistent and the stopping rule is asymptotically efficient, as the width goes to zero. Furthermore, a second order result for the difference between the expected stopping time and the (total) optimal fixed sample size is established. The theoretical results are supported by appropriate simulations.     

Case-cohort analysis with general additive-multiplicative hazard models

The case-cohort design is widely used in large epidemiological studies and prevention trials for cost reduction. In such a design, covariates are assembled only for a subcohort which is a random subset of the entire cohort and any additional cases outside the subcohort. In this paper, we discuss the case-cohort analysis with a class of general additive-multiplicative hazard models which includes the commonly used Cox model and additive hazard model as special cases. Two sampling schemes for the subcohort, Bernoulli sampling with arbitrary selection probabilities and stratified simple random sampling with fixed subcohort sizes, are discussed. In each setting, an estimating function is constructed to estimate the regression parameters. The resulting estimator is shown to be consistent and asymptotically normally distributed. The limiting variance-covariance matrix can be consistently estimated by the case-cohort data. A simulation study is conducted to assess the finite sample performances of the proposed method and a real example is provided.     

一类抽样统计量的性质

通过把多指标变量（X1,X2…,Xk）的值域划分为若干矩形子区域的方式,构造出一类抽样统计量,得出了其具有的优良性质,并在合理分配样本容量的条件下得出了其抽样误差明显好于简单随机抽样误差的结论．     

Estimation of the Common Mean of a Bivariate Normal Population

In this paper we discuss the problem of estimating the common mean of a bivariate normal population based on paired data as well as data on one of the marginals. Two double sampling schemes with the second stage sampling being either a simple random sampling (SRS) or a ranked set sampling (RSS) are considered. Two common mean estimators are proposed. It is found that under normality, the proposed RSS common mean estimator is always superior to the proposed SRS common mean estimator and other existing estimators such as the RSS regression estimator proposed by Yu and Lam (1997, Biometrics, 53, 1070–1080). The problem of estimating the mean Reid Vapor Pressure (RVP) of regular gasoline based on field and laboratory data is considered.     

Algorithms to Find Exact Inclusion Probabilities for Conditional Poisson Sampling and Pareto πps Sampling Designs

Conditional Poisson Sampling Design as developed by Haje´k may be defined as a Poisson sampling conditioned by the requirement that the sample has fixed size. In this paper, an algorithm is implemented to calculate the conditional inclusion probabilities given the inclusion probabilities under Poisson Sampling. A simple algorithm is also given for second order inclusion probabilities in Conditional Poisson Sampling. Furthermore a numerical method is introduced to compute the unconditional inclusion probabilities when the conditional inclusion probabilities are predetermined. Simultaneously, we study the Pareto ps sampling design. This method, introduced by Rose´n, belongs to a class of sampling schemes called Order Sampling with Fixed Distribution Shape. Methods are provided to compute the first and second order inclusion probabilities numerically also in this case, as well as two procedures to adjust the parameters to get predetermined inclusion probabilities.     

Empirical Likelihood Inference Under Stratified Random Sampling in the Presence of Measurement Error

Suppose that several different imperfect instruments and one perfect instrument are used independently to measure some characteristic of a population. In order to make full use of the sample information, in this paper the empirical likelihood method is put forward for making inferences on parameters of interest under stratified random sampling in the presence of measurement error, Our results show that it can lead to estimators which are asymptotically normal and utilize all the available sample information. We also obtain the asymptotic distribution of empirical likelihood testing statistics. In particular, we apply the method to obtain estimator and confidence interval of population mean.     

Cover time and mixing time of random walks on dynamic graphs

The application of simple random walks on graphs is a powerful tool that is useful in many algorithmic settings such as network exploration, sampling, information spreading, and distributed computing. This is due to the reliance of a simple random walk on only local data, its negligible memory requirements, and its distributed nature. It is well known that for static graphs the cover time, that is, the expected time to visit every node of the graph, and the mixing time, that is, the time to sample a node according to the stationary distribution, are at most polynomial relative to the size of the graph. Motivated by real world networks, such as peer‐to‐peer and wireless networks, the conference version of this paper was the first to study random walks on arbitrary dynamic networks. We study the most general model in which an oblivious adversary is permitted to change the graph after every step of the random walk. In contrast to static graphs, and somewhat counter‐intuitively, we show that there are adversary strategies that force the expected cover time and the mixing time of the simple random walk on dynamic graphs to be exponentially long, even when at each time step the network is well connected and rapidly mixing. To resolve this, we propose a simple strategy, the lazy random walk, which guarantees, under minor conditions, polynomial cover time and polynomial mixing time regardless of the changes made by the adversary.     

Stochastic Comparisons of Symmetric Sampling Designs

We compare estimators of the integral of a monotone function f that can be observed only at a sample of points in its domain, possibly with error. Most of the standard literature considers sampling designs ordered by refinements and compares them in terms of mean square error or, as in Goldstein et al. (2011), the stronger convex order. In this paper we compare sampling designs in the convex order without using partition refinements. Instead we order two sampling designs based on partitions of the sample space, where a fixed number of points is allocated at random to each partition element. We show that if the two random vectors whose components correspond to the number allocated to each partition element are ordered by stochastic majorization, then the corresponding estimators are likewise convexly ordered. If the function f is not monotone, then we show that the convex order comparison does not hold in general, but a weaker variance comparison does.     

An instantaneous replenishment model under the effect of a sampling policy for defective items

We propose to study a EOQ-type inventory model with unreliable supply, with each order containing a random proportion of defective items. Every time an order is received, an acceptance sampling plan is applied to the lot, according to which only a sample is inspected instead of the whole lot. If the sample conforms to the standards, i.e. if the number of imperfect items is below an “acceptance number”, no further screening is performed. Otherwise, the lot is subject to 100% screening. We formulate an integer non-linear mathematical program that integrates inventory and quality decisions into a unified profit model, to jointly determine the optimal lot size and optimal sampling plan, characterized by a sample size, and an acceptance number. The optimal decisions are determined in a way to achieve a certain average outgoing quality limit (AOQL), which is the highest proportion of defective items in the outgoing material sold to customers. We provide a counter-example demonstrating that the expected profit function, objective of the mathematical program, is not jointly concave in the lot and sample size. However, we show that for a given sampling plan, the expected profit function is concave in the lot size. A solution procedure is presented to compute the optimal solution. Numerical analysis is provided to gain managerial insights by analyzing the impact of changing various model parameters on the optimal solution. We also show numerically that the optimal profit determined using this model is significantly higher when compared to the optimal profit obtained using Salameh and Jaber (2000)’s [1] model, indicating much higher profits when acceptance sampling is used.