Approximation of the Bivariate Renewal Function

Recently, Kambo and his co-researchers (2012) proposed a method of approximation for evaluating the one-dimensional renewal function based on the first three moments. Their method is simple and elegant, which gives exact values for well-known distributions. In this article, we propose an analogous method for the evaluation of bivariate renewal function based on the first two moments of the variables and their joint moment. The proposed method yields exact results for certain widely used bivariate distributions like bivariate exponential distribution, bivariate Weibull distributions, and bivariate Pareto distributions. An illustrative example in the form of a two-dimensional warranty problem is considered and comparisons of our method are made with the results of other models.     

Estimation of generalized linear latent variable models

Summary.  Generalized linear latent variable models (GLLVMs), as defined by Bartholomew and Knott, enable modelling of relationships between manifest and latent variables. They extend structural equation modelling techniques, which are powerful tools in the social sciences. However, because of the complexity of the log-likelihood function of a GLLVM, an approximation such as numerical integration must be used for inference. This can limit drastically the number of variables in the model and can lead to biased estimators. We propose a new estimator for the parameters of a GLLVM, based on a Laplace approximation to the likelihood function and which can be computed even for models with a large number of variables. The new estimator can be viewed as an M -estimator, leading to readily available asymptotic properties and correct inference. A simulation study shows its excellent finite sample properties, in particular when compared with a well-established approach such as LISREL. A real data example on the measurement of wealth for the computation of multidimensional inequality is analysed to highlight the importance of the methodology.     

Deconvolution with supersmooth distributions

Nonparametric deconvolution problems require one to recover an unknown density when the data are contaminated with errors. Optimal global rates of convergence are found under the weighted L_p-loss (1 ≤ p ≤ ∞). It appears that the optimal rates of convergence are extremely low for supersmooth error distributions. To resolve this difficulty, we examine how high the noise level can be for deconvolution to be feasible, and for the deconvolution estimate to be as good as the ordinary density estimate. It is shown that if the noise level is not too high, nonparametric Gaussian deconvolution can still be practical. Several simulation studies are also presented.     

A Bayesian Analysis for Accelerated Lifetime Tests Under an Exponential Power Law Model with Threshold Stress

In this paper, we present a Bayesian methodology for modelling accelerated lifetime tests under a stress response relationship with a threshold stress. Both Laplace and MCMC methods are considered. The methodology is described in detail for the case when an exponential distribution is assumed to express the behaviour of lifetimes, and a power law model with a threshold stress is assumed as the stress response relationship. We assume vague but proper priors for the parameters of interest. The methodology is illustrated by a accelerated failure test on an electrical insulation film.     

Testing symmetry under a skew Laplace model

We develop tests of hypothesis about symmetry based on samples from possibly asymmetric Laplace distributions and present exact and limiting distribution of the test statistics. We postulate that the test statistic derived under the Laplace model is a rational choice as a measure of skewness and can be used in testing symmetry for other, quite general classes of skew distributions. Our results are applied to foreign exchange rates for 15 currencies.     

谁开创了贝叶斯学派？——对拉普拉斯1774年一篇文章的回顾

1764年,贝叶斯的遗作《机遇理论中一个问题的解》，是当今统计学界贝叶斯学派的开山之作，然而直到20世纪，贝叶斯的文章却并未对后世贝叶斯学派的发展产生重大影响。事实上，真正促使贝叶斯的思想在科学界得到广泛传播的关键人物是大科学家拉普拉斯。1774年，拉普拉斯发表的关于贝叶斯理论的里程碑式的文章，使现代读者充分认识到拉普拉斯对贝叶斯学派发展所起的巨大作用，并从拉普拉斯的思想中获得了有益的新知。     

BATHTUB-TYPE CURVES IN RELIABILITY AND BEYOND

Finding optimal, or at least good, maintenance and repair policies is crucial in reliability engineering. Likewise, describing life phases of human mortality is important when determining social policy or insurance premiums. In these tasks, one searches for distributions to fit data and then makes inferences about the population(s). In the present paper, we focus on bathtub‐type distributions and provide a view of certain problems, methods and solutions, and a few challenges, that can be encountered in reliability engineering, survival analysis, demography and actuarial science.     

Higher-order Bayesian Approximations for Pseudo-posterior Distributions

The theory of higher-order asymptotics provides accurate approximations to posterior distributions for a scalar parameter of interest, and to the corresponding tail area, for practical use in Bayesian analysis. The aim of this article is to extend these approximations to pseudo-posterior distributions, e.g., posterior distributions based on a pseudo-likelihood function and a suitable prior, which are proved to be particularly useful when the full likelihood is analytically or computationally infeasible. In particular, from a theoretical point of view, we derive the Laplace approximation for a pseudo-posterior distribution, and for the corresponding tail area, for a scalar parameter of interest, also in the presence of nuisance parameters. From a computational point of view, starting from these higher-order approximations, we discuss the higher-order tail area (HOTA) algorithm useful to approximate marginal posterior distributions, and related quantities. Compared to standard Markov chain Monte Carlo methods, the main advantage of the HOTA algorithm is that it gives independent samples at a negligible computational cost. The relevant computations are illustrated by two examples.     

Marginal likelihood estimation from the Metropolis output: tips and tricks for efficient implementation in generalized linear latent variable models

The marginal likelihood can be notoriously difficult to compute, and particularly so in high-dimensional problems. Chib and Jeliazkov employed the local reversibility of the Metropolis–Hastings algorithm to construct an estimator in models where full conditional densities are not available analytically. The estimator is free of distributional assumptions and is directly linked to the simulation algorithm. However, it generally requires a sequence of reduced Markov chain Monte Carlo runs which makes the method computationally demanding especially in cases when the parameter space is large. In this article, we study the implementation of this estimator on latent variable models which embed independence of the responses to the observables given the latent variables (conditional or local independence). This property is employed in the construction of a multi-block Metropolis-within-Gibbs algorithm that allows to compute the estimator in a single run, regardless of the dimensionality of the parameter space. The counterpart one-block algorithm is also considered here, by pointing out the difference between the two approaches. The paper closes with the illustration of the estimator in simulated and real-life data sets.     

A non-iterative posterior sampling algorithm for linear quantile regression model

In this article, a non-iterative posterior sampling algorithm for linear quantile regression model based on the asymmetric Laplace distribution is proposed. The algorithm combines the inverse Bayes formulae, sampling/importance resampling, and the expectation maximization algorithm to obtain independently and identically distributed samples approximately from the observed posterior distribution, which eliminates the convergence problems in the iterative Gibbs sampling and overcomes the difficulty in evaluating the standard deviance in the EM algorithm. The numeric results in simulations and application to the classical Engel data show that the non-iterative sampling algorithm is more effective than the Gibbs sampling and EM algorithm.