A new way of quantifying the symmetry of a random variable: Estimation and hypothesis testing

New measures of skewness for real-valued random variables are proposed. The measures are based on a functional representation of real-valued random variables. Specifically, the expected value of the transformed random variable can be used to characterize the distribution of the original variable. Firstly, estimators of the proposed skewness measures are analyzed. Secondly, asymptotic tests for symmetry are developed. The tests are consistent for both discrete and continuous distributions. Bootstrap versions improving the empirical results for moderated and small samples are provided. Some simulations illustrate the performance of the tests in comparison to other methods. The results show that our procedures are competitive and have some practical advantages.     

Intrinsically Dynamic Multistate Models

Multistate life table models, which follow persons through more than one living state, have found increasing use in demographic analyses. Multistate stable populations, however, are infrequently used because the constant rate assumption is quite strong and such populations can take centuries to approach stability. Dynamic models, that is models where the rates can change over time, are examined to derive a new solution for the size and composition of a multistate population in terms of the sequence of underlying population projection matrices (PPMs). Constraints on the subordinate eigenvalues and the subordinate eigenvectors of the time-varying PPMs produce a model population that grows according to the dominant eigenvalues of each time-specific PPM and has a state composition that depends only on the most recent PPM. The two living state model is examined in detail, relationships between the PPM elements and the size and composition of the model are explored, and two illustrative applications of the model are presented.     

A note on the random yield from the perspective of the supply chain

Keren [The single-period inventory problem: extension to random yield from the perspective of the supply chain. Omega 2009;37:801-10] considers a supply chain in which the distributor faces a known demand and orders from the producer subject to a random production yield, and shows that the distributor may find it optimal to order more than what is needed due to supply uncertainty under a uniform distribution. However, Keren (2009) does not address the questions whether it is always optimal for the distributor to order more, or when to order more. In this note, we point out that ordering more is not always an optimal strategy and specify the condition under which this strategy becomes optimal. We also examine the profit losses of the supply chain members resulting from the random yield supply, which is another question not considered in Keren (2009). The producer is found to possibly benefit from this production yield uncertainty, although the performances of the distributor and of the entire supply chain are always undermined. Our results are obtained under a more generalized yield distribution, and can thus be applied to wider industrial domains.     

Experimental Games on Networks: Underpinnings of Behavior and Equilibrium Selection

In this paper, we describe a series of laboratory experiments that implement specific examples of a general network structure. Specifically, actions are either strategic substitutes or strategic complements, and participants have either complete or incomplete information about the structure of a random network. Since economic environments typically have a considerable degree of complementarity or substitutability, this framework applies to a wide variety of settings. We examine behavior and equilibrium selection. The degree of equilibrium play is striking, in particular with incomplete information. Behavior closely resembles the theoretical equilibrium whenever this is unique; when there are multiple equilibria, general features of networks, such as connectivity, clustering, and the degree of the players, help to predict informed behavior in the lab. People appear to be strongly attracted to maximizing aggregate payoffs (social efficiency), but there are forces that moderate this attraction: (1) people seem content with (in the aggregate) capturing only the lion's share of the efficient profits in exchange for reduced exposure to loss, and (2) uncertainty about the network structure makes it considerably more difficult to coordinate on a demanding, but efficient, equilibrium that is typically implemented with complete information.     

Estimation of parameters in heavy-tailed distribution when its second order tail parameter is known

Estimating parameters in heavy-tailed distribution plays a central role in extreme value theory. It is well known that classical estimators based on the first order asymptotics such as the Hill, rank-based and QQ estimators are seriously biased under finer second order regular variation framework. To reduce the bias, many authors proposed the so-called second order reduced bias estimators for both first and second order tail parameters. In this work, estimation of parameters in heavy-tailed distributions are studied under the second order regular variation framework when the second order parameter in the distribution tail is known. This is motivated in large part by a recent work by the authors showing that the second order tail parameter is known for a large class of popular random difference equations (for example, ARCH models). The focus is on least squares estimators that generalize rank-based and QQ estimators. Though other possible estimators are also briefly discussed, the least squares estimators are most simple to use and perform best for finite samples in Monte Carlo simulations.     

A Bayesian predictive inference for small area means incorporating covariates and sampling weights

The main goal in small area estimation is to use models to ‘borrow strength’ from the ensemble because the direct estimates of small area parameters are generally unreliable. However, model-based estimates from the small areas do not usually match the value of the single estimate for the large area. Benchmarking is done by applying a constraint, internally or externally, to ensure that the ‘total’ of the small areas matches the ‘grand total’. This is particularly useful because it is difficult to check model assumptions owing to the sparseness of the data. We use a Bayesian nested error regression model, which incorporates unit-level covariates and sampling weights, to develop a method to internally benchmark the finite population means of small areas. We use two examples to illustrate our method. We also perform a simulation study to further assess the properties of our method.     

Bayesian inference for generalized additive mixed models based on Markov random field priors

Most regression problems in practice require flexible semiparametric forms of the predictor for modelling the dependence of responses on covariates. Moreover, it is often necessary to add random effects accounting for overdispersion caused by unobserved heterogeneity or for correlation in longitudinal or spatial data. We present a unified approach for Bayesian inference via Markov chain Monte Carlo simulation in generalized additive and semiparametric mixed models. Different types of covariates, such as the usual covariates with fixed effects, metrical covariates with non-linear effects, unstructured random effects, trend and seasonal components in longitudinal data and spatial covariates, are all treated within the same general framework by assigning appropriate Markov random field priors with different forms and degrees of smoothness. We applied the approach in several case-studies and consulting cases, showing that the methods are also computationally feasible in problems with many covariates and large data sets. In this paper, we choose two typical applications.     

双重分层抽样中的校正估计

校正估计法已被大量运用于抽样调查中,它利用辅助信息构造的校正权重提高了对总体总值（或均值）的估计精度。本文提出了分层抽样中的校正组合比率估计量,并推广到分层双重抽样中。同时给出新估计量的近似方差表达式。最后利用计算机随机模拟验证较正估计量对估计精度的改进。     

Decision Making in `Random in a Broad Sense' Environments

It is shown that the uncertainty connected with a `random in a broad sense' (not necessarily stochastic) event always has some `statistical regularity' (SR) in the form of a family of finite-additive probability distributions. The specific principle of guaranteed result in decision making is introduced. It is shown that observing this principle of guaranteed result leads to determine the one optimality criterion corresponding to a decision system with a given `statistical regularity'.     

Sublinear time width-bounded separators and their application to the protein side-chain packing problem

Given d>2 and a set of n grid points Q in ℜ ^d , we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in sublinear time such that Q has at most points on either side of the hyper-plane, and at most points within distance to the hyper-plane, where c _d is a constant for fixed d. In particular, c ₃=1.209. To our best knowledge, this is the first sublinear time algorithm for finding geometric separators. Our 3D separator is applied to derive an algorithm for the protein side-chain packing problem, which improves and simplifies the previous algorithm of Xu (Research in computational molecular biology, 9th annual international conference, pp. 408–422, 2005). This research is supported by Louisiana Board of Regents fund under contract number LEQSF(2004-07)-RD-A-35. The part of this research was done while Bin Fu was associated with the Department of Computer Science, University of New Orleans, LA 70148, USA and the Research Institute for Children, 200 Henry Clay Avenue, New Orleans, LA 70118, USA.