Open Access Open Access  Restricted Access Access granted  Restricted Access Subscription Access

Vol 26, No 1 (2017)

Article

On the lower bound in second order estimation for Poisson processes: Asymptotic efficiency

Gasparyan S.B., Kutoyants Y.A.

Abstract

In the estimation problem of the mean function of an inhomogeneous Poisson process there is a class of kernel type estimators that are asymptotically efficient alongside with the empirical mean function. We start by describing such a class of estimators which we call first order efficient estimators. To choose the best one among them we prove a lower bound that compares the second order term of the mean integrated square error of all estimators. The proof is carried out under the assumption on the mean function Λ(·) that Λ(τ) = S, where S is a known positive number. In the end, we discuss the possibility of the construction of an estimator which attains this lower bound, thus, is asymptotically second order efficient.

Mathematical Methods of Statistics. 2017;26(1):1-19
pages 1-19 views

Saddlepoint approximations to the distribution of the total distance of the multivariate isotropic and von Mises–Fisher random walks

Gatto R.

Abstract

This article considers the random walk over Rp, with p ≥ 2, where the directions taken by the individual steps follow either the isotropic or the vonMises–Fisher distributions. Saddlepoint approximations to the density and to upper tail probabilities of the total distance covered by the random walk, i.e., of the length of the resultant, are derived. The saddlepoint approximations are onedimensional and simple to compute, even though the initial problem is p-dimensional. Numerical illustrations of the high accuracy of the proposed approximations are provided.

Mathematical Methods of Statistics. 2017;26(1):20-36
pages 20-36 views

Asymptotic behavior of truncated stochastic approximation procedures

Sharia T., Zhong L.

Abstract

We study asymptotic behavior of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix-valued random step-size sequence, and a dynamically changing random regression function. In particular, we show that under quitemild conditions, stochastic approximation procedures are asymptotically linear in the statistical sense, that is, they can be represented as weighted sums of random variables. Therefore, a suitable formof the central limit theoremcan be applied to derive asymptotic distribution of the corresponding processes. The theory is illustrated by various examples and special cases.

Mathematical Methods of Statistics. 2017;26(1):37-54
pages 37-54 views

An oracle inequality for quasi-Bayesian nonnegative matrix factorization

Alquier P., Guedj B.

Abstract

The aim of this paper is to provide some theoretical understanding of quasi-Bayesian aggregation methods of nonnegative matrix factorization. We derive an oracle inequality for an aggregated estimator. This result holds for a very general class of prior distributions and shows how the prior affects the rate of convergence.

Mathematical Methods of Statistics. 2017;26(1):55-67
pages 55-67 views

A supermartingale argument for characterizing the functional Hill process weak law for small parameters

Fall A.M., Lo G.S., Adekpedjou A., Ndiaye C.H.

Abstract

The paper deals with the asymptotic laws of functionals of standard exponential random variables. These classes of statistics are closely related to estimators of the extreme value index when the underlying distribution function is in theWeibull domain of attraction.We use techniques based on martingales theory to describe the non-Gaussian asymptotic distribution of the aforementioned statistics.We provide results of a simulation study as well as statistical tests that may be of interest with the proposed results.

Mathematical Methods of Statistics. 2017;26(1):68-80
pages 68-80 views