Asymptotic Expansions for i.i.d. Sums Via Lower-order Convolutions

In this article, we introduce new asymptotic expansions for probability functions of sums of independent and identically distributed random variables. Results are obtained by efficiently employing information provided by lower-order convolutions. In comparison with Edgeworth-type theorems, advantages include improved asymptotic results in the case of symmetric random variables and ease of computation of main error terms and asymptotic crossing points. The first-order estimate can perform quite well against the corresponding renormalized saddlepoint approximation and, pointwise, requires evaluation of only a single convolution integral. While the new expansions are fairly straightforward, the implications are fortuitous and may spur further related work.     

A new discrete distribution involving laguerre polynomials

A discrete distribution in which the probabilities are expressible as Laguerre polynomials is formulated in terms of a probability generating function involving three parameters. The skewness and kurtosis is given for members of the family corresponding to various parameter values. Several estimators of the parameters are proposed, including some based on minimum chi-square. All the estimators are compared on the basis of asymptotic relative efficiency.     

The Lindeberg-Feller theorem for positive definite densities

We consider the Lindeberg-Feller model for independent random variables and focus our attention on the behaviour of the probability densities q_{n} of sums S_{n}, n\geq 1 . We obtain a theorem on the convergence of q_{n} to the standard normal density \varphi which resembles the well known limit theorem for distribution functions--provided that the q_{n} are positive definite. A special case is the following: if q_{n}(0)\rightarrow\varphi(0) as n\rightarrow\infty then the Lindeberg condition guarantees that the convergence of q_{n} to \varphi continues to the real line.     

Modeling Finite‐Time Failure Probabilities in Risk Analysis Applications

In this article, we introduce a framework for analyzing the risk of systems failure based on estimating the failure probability. The latter is defined as the probability that a certain risk process, characterizing the operations of a system, reaches a possibly time‐dependent critical risk level within a finite‐time interval. Under general assumptions, we define two dually connected models for the risk process and derive explicit expressions for the failure probability and also the joint probability of the time of the occurrence of failure and the excess of the risk process over the risk level. We illustrate how these probabilistic models and results can be successfully applied in several important areas of risk analysis, among which are systems reliability, inventory management, flood control via dam management, infectious disease spread, and financial insolvency. Numerical illustrations are also presented.     

Beta-Bernstein Smoothing for Regression Curves with Compact Support

ABSTRACT. The problem of boundary bias is associated with kernel estimation for regression curves with compact support. This paper proposes a simple and uni(r)ed approach for remedying boundary bias in non-parametric regression, without dividing the compact support into interior and boundary areas and without applying explicitly different smoothing treatments separately. The approach uses the beta family of density functions as kernels. The shapes of the kernels vary according to the position where the curve estimate is made. Theyare symmetric at the middle of the support interval, and become more and more asymmetric nearer the boundary points. The kernels never put any weight outside the data support interval, and thus avoid boundary bias. The method is a generalization of classical Bernstein polynomials, one of the earliest methods of statistical smoothing. The proposed estimator has optimal mean integrated squared error at an order of magnitude n ^−4/5, equivalent to that of standard kernel estimators when the curve has an unbounded support.     

新的图像加密方法

针对数字图像信息数据量大、冗余度高和像素间相关性强等特点,提出了一种基于二元多项式的图像加密新方法。在对图像的加密过程中,该方法使用另一幅图像作为密钥,使得密钥形象直观且伪装性强,而密钥图像的尺寸可以远远小于加密图像,便于保存。因加密的大部分步骤中只用到了有限域的加法运算,因此该算法的加密效率较高。该加密方法不仅有安全性高和便于图像的局部加密等优点,还可以方便地推广到视频的图像加密领域,具有很好的应用前景。     

EXACT AND APPROXIMATED RELATIONS BETWEEN NEGATIVE HYPERGEOMETRIC AND NEGATIVE BINOMIAL PROBABILITIES

We derive orthogonal expansions in terms of the Meixner polynomials of the first kind for hypergeometric probabilities. We show how these expansions can be used to obtain negative binomial approximations to negative hypergeometric probabilities. Some limit properties of these approximations are studied and also the extension of these results to cumulative probabilities.     

M-Estimation in the partially linear model with Bernstein polynomials under shape constrains

We develope an M-estimator for partially linear models in which the nonparametric component is subject to various shape constraints. Bernstein polynomials are used to approximate the unknown nonparametric function, and shape constraints are imposed on the coefficients. Asymptotic normality of regression parameters and the optimal rate of convergence of the shape-restricted nonparametric function estimator are established under very mild conditions. Some simulation studies and a real data analysis are conducted to evaluate the finite sample performance of the proposed method.