Empirical Likelihood for Partially Linear Single-Index Errors-in-Variables Model

In this article, we consider the application of the empirical likelihood method to a partially linear single-index model. We focus on the case where some covariates are measured with additive errors. It is shown that the empirical log-likelihood ratio at the true parameter converges to the standard chi-square distribution. Simulations show that the proposed confidence region has coverage probability which is closer to the nominal level, as well as narrower than those of normal approximation method. A real data example is given.     

The Finite Time Ruin Probability of a New Risk Model Based on Entrance Process

In this article, we consider a new insurance risk model based on the entrance process proposed in Li et al. (2005 Li , Z. , Zhu , J. , Chen , F. ( 2005 ). Study of a risk model based on the entrance process . Statist. Probab. Lett. 72 : 1 – 10 .[Crossref], [Web of Science ®] , [Google Scholar]), and investigate the finite time ruin probabilities of this model. It is showed that an exponential upper bound for the finite time ruin probability exists, when the distributions of the claim size are light tailed. Furthermore, when the distributions of the claim size are heavy tailed, an asymptotic formula for the finite time ruin probability is obtained.     

An Approximation Model of the Collective Risk Model with INAR(1) Claim Process

Cossette et al. (2010 Cossette, H., Marceau, E., Maume-Deschamps, V. (2010). Discerte-time risk models based on time series for count random variables. ASTIN Bull. 40:123–150.[Crossref], [Web of Science ®] , [Google Scholar], 2011 Cossette, H., Marceau, E., Toureille, F. (2011). risk models based on time series for count random variables. Insur. Math. Econ. 48:19–28.[Crossref], [Web of Science ®] , [Google Scholar]) gave a novel collective risk model where the total numbers of claims satisfy the first-order integer-valued autoregressive process. For a risk model, it is interesting to investigate the upper bound of ruin probability. However, the loss increments of the above model are dependent; it is difficult to derive the upper bound of ruin probability. In this article, we propose an approximation model with stationary independent increments. The upper bound of ruin probability and the adjustment coefficient are derived. The approximation model is illustrated via four simulated examples. Results show that the gap of the approximation model and dependent model can be ignored by adjusting values of parameters.     

Uniform Distributions on the Integers: A connection to the Bernouilli Random Walk

Associate to each subset of the integers its almost sure limiting relative frequency under the Bernouilli random walk, if it has one. The resulting probability space is purely finitely additive, and uniform in the sense of residue classes and shift-invariance. However, it is not uniform in the sense of limiting relative frequency.     

关键词拍卖中基于广义第一价格的投标价格决策分析

在关键词拍卖中,由于广告商不能保证对关键词的估价是最优投标价格,因此如何选取最优的关键词投标价格一直是广告商急于解决的问题。基于与Friedman投标模型假设条件等价的关键词拍卖投标假设条件,计算了各个关键词广告位置的胜标概率,并在广义第一价格拍卖机制下建立了关键词投标价格决策模型。该模型可以使广告商选取最优的关键词投标价格。最后通过仿真验证了该模型的有效性。     

Confidence intervals for the difference between independent binomial proportions: comparison using a graphical approach and moving averages

This paper uses graphical methods to illustrate and compare the coverage properties of a number of methods for calculating confidence intervals for the difference between two independent binomial proportions. We investigate both small‐sample and large‐sample properties of both two‐sided and one‐sided coverage, with an emphasis on asymptotic methods. In terms of aligning the smoothed coverage probability surface with the nominal confidence level, we find that the score‐based methods on the whole have the best two‐sided coverage, although they have slight deficiencies for confidence levels of 90% or lower. For an easily taught, hand‐calculated method, the Brown‐Li ‘Jeffreys’ method appears to perform reasonably well, and in most situations, it has better one‐sided coverage than the widely recommended alternatives. In general, we find that the one‐sided properties of many of the available methods are surprisingly poor. In fact, almost none of the existing asymptotic methods achieve equal coverage on both sides of the interval, even with large sample sizes, and consequently if used as a non‐inferiority test, the type I error rate (which is equal to the one‐sided non‐coverage probability) can be inflated. The only exception is the Gart‐Nam ‘skewness‐corrected’ method, which we express using modified notation in order to include a bias correction for improved small‐sample performance, and an optional continuity correction for those seeking more conservative coverage. Using a weighted average of two complementary methods, we also define a new hybrid method that almost matches the performance of the Gart‐Nam interval. Copyright © 2014 John Wiley & Sons, Ltd.     

Effect of dimensionality on discrimination

Discrimination problems in a high-dimensional setting is considered. New results are concerned with the role of the dimensionality in the performance of the discrimination procedure. Assuming that data consist of a block structure two different asymptotic approaches are presented. These approaches are characterized by different types of relations between the dimensionality and the size of the training samples. Asymptotic expressions for the error probabilities are obtained and a consistent approximation of the discriminant function is proposed. Throughout the paper the importance of the dimensionality in the asymptotic analysis is stressed.     

Optimal Hoeffding-like inequalities under a symmetry assumption

In this paper, we prove a Hoeffding-like inequality for the survival function of a sum of symmetric independent identically distributed random variables, taking values in a segment [?b, b] of the reals. The symmetric case is relevant to the auditing practice and is an important case study for further investigations. The bounds as given by Hoeffding in 1963 cannot be improved upon unless we restrict the class of random variables, for instance, by assuming the law of the random variables to be symmetric with respect to their mean, which we may assume to be zero. The main result in this paper is an improvement of the Hoeffding bound for i.i.d. random variables which are bounded and have a (upper bound for the) variance by further assuming that they have a symmetric law.