Moderate deviations for the random weighted sums of END random variables with consistently varying tails

In this paper, we study moderate deviations for random weighted sums of extended negative dependent (END) random variables, which are consistently-varying tailed and not necessarily identically distributed. When these END random variables are independent of their weights, and the weights are positive random variables with two-sided bounds, the results shows END structure and the dependence between the weights have no effects on the asymptotic behavior of moderate deviations of partial sums and random sums.     

Moderate deviations for the random weighted sums of WUOD random variables with consistently varying tails

Abstract

In this paper, we investigate the moderate deviations for random weighted sums of widely upper orthant dependent (WUOD) random variables with consistently varying tails, which are not necessarily identically distributed. In the end, we obtain the asymptotic relations for random weighted sums of random variables.     

Saddlepoint approximations to sensitivities of tail probabilities of random sums and comparisons with Monte Carlo estimators

This article proposes computing sensitivities of upper tail probabilities of random sums by the saddlepoint approximation. The considered sensitivity is the derivative of the upper tail probability with respect to the parameter of the summation index distribution. Random sums with Poisson or Geometric distributed summation indices and Gamma or Weibull distributed summands are considered. The score method with importance sampling is considered as an alternative approximation. Numerical studies show that the saddlepoint approximation and the method of score with importance sampling are very accurate. But the saddlepoint approximation is substantially faster than the score method with importance sampling. Thus, the suggested saddlepoint approximation can be conveniently used in various scientific problems.     

Efficient simulation of tail probabilities in a queueing model with heterogeneous servers

This paper considers a multi-server queue with Markov-modulated Poisson input and server-dependent phase-type service times. We develop an efficient rare-event simulation technique to estimate the probability that the number of customers in this system reaches a high value. Relying on explicit bounds on the probability under consideration as well as the associated likelihood ratio, we succeed in proving that the proposed estimator is of bounded relative error. Simulation experiments illustrate the significant speed-up that can be achieved by the proposed algorithm.     

Extension of some large deviation results for posterior distributions

We consider a family of statistical models with positive unknown parameter (which includes some well-known models for censored exponential data) and some statistical models for samples from stationary Gaussian processes. We prove large deviation results for posterior distributions and, in some cases, also for maximum likelihood estimators.     

Complete moment convergence for weighted sums of extended negatively dependent random variables

Complete moment convergence for weighted sums of sequence of extended negatively dependent (END) random variables is discussed. Some new sufficient and necessary conditions of complete moment convergence for weighted sums of END random variables are obtained, which improve and extend some well-known results in the literature.     

Particle filtering for partially observed Gaussian state space models

Summary. Solving Bayesian estimation problems where the posterior distribution evolves over time through the accumulation of data has many applications for dynamic models. A large number of algorithms based on particle filtering methods, also known as sequential Monte Carlo algorithms, have recently been proposed to solve these problems. We propose a special particle filtering method which uses random mixtures of normal distributions to represent the posterior distributions of partially observed Gaussian state space models. This algorithm is based on a marginalization idea for improving efficiency and can lead to substantial gains over standard algorithms. It differs from previous algorithms which were only applicable to conditionally linear Gaussian state space models. Computer simulations are carried out to evaluate the performance of the proposed algorithm for dynamic tobit and probit models.     

Equivalence of Gaussian measures for some nonstationary random fields

Gaussian random fields whose covariance structures are described by a power law model provide a simple and flexible class of models for isotropic random fields. This class includes fractional Brownian fields as a special case. Because these random fields are nonstationary, the extensive results available on equivalence of Gaussian measures for stationary models do not apply to them. This work shows that results on equivalence for two stationary Gaussian random field models extend in a natural way to the equivalence of a stationary model and a power law model. This result is used to show that if we use a power law model for predicting a random field at unobserved locations when in fact the random field is stationary, we can obtain asymptotically optimal predictions as long as the high frequency behavior of the true spectral density is sufficiently close to the high frequency behavior of the spectral density of the power law model.     

Asymptotic Tail Properties of Student's t-Distribution

We investigate the asymptotic behavior of the probability density function (pdf) and the cumulative distribution function (cdf) of Student's t-distribution with ν > 0 degrees of freedom (t _ν for short) for ν tending to infinity when the argument x = x _ν of the pdf (cdf) depends on ν and tends to ± ∞ (?∞). To this end, we consider the ratio of the pdf's (cdf's) of the t _ν- and the standard normal distribution. Depending on the choice of the argument x _ν, the pdf-ratio (cdf-ratio) tends to 1, a fixed value greater than 1, or to ∞. As a byproduct, we obtain a result for Mill' ratio when x _ν → ?∞.     

Precise large deviations for the difference of two sums of END random variables with heavy tails

Assume that there are two types of insurance contracts in an insurance company, and the ith related claims are denoted by {X_ij, j ? 1}, i = 1, 2. In this article, the asymptotic behaviors of precise large deviations for non random difference ∑^n₁(t)_{j = 1}X_1j ? ∑^n₂(t)_{j = 1}X_2j and random difference ∑^N₁(t)_{j = 1}X_1j ? ∑^N₂(t)_{j = 1}X_2j are investigated, and under several assumptions, some corresponding asymptotic formulas are obtained.     

Asymptotics of maxima and sums for a type of strongly dependent isotropic Gaussian random fields

For a type of strongly dependent isotropic Gaussian random fields introduced by Mittal (1976 Mittal, Y. 1976. A class of isotropic covariances functions. Pacific Journal of Mathematics 64:517–38.[Crossref], [Web of Science ®] , [Google Scholar]), the joint limiting distribution of the maximum and the sum for the Gaussian random fields is derived. The asymptotic relation between the maximum and sum of the continuous time strongly dependent isotropic Gaussian random fields and the maximum and sum of this fields sampled at discrete time points is also obtained.     

Fast sampling of Gaussian Markov random fields

This paper demonstrates how Gaussian Markov random fields (conditional autoregressions) can be sampled quickly by using numerical techniques for sparse matrices. The algorithm is general and efficient, and expands easily to various forms for conditional simulation and evaluation of normalization constants. We demonstrate its use by constructing efficient block updates in Markov chain Monte Carlo algorithms for disease mapping.     

Precise large deviations for the difference of two sums of WUOD and non identically distributed random variables with dominatedly varying tails

In this article, we study large deviations for non random difference ∑^n₁(t)_{j = 1}X_1j ? ∑^n₂(t)_{j = 1}X_2j and random difference ∑^N₁(t)_{j = 1}X_1j ? ∑^N₂(t)_{j = 1}X_2j, where {X_1j, j ? 1} is a sequence of widely upper orthant dependent (WUOD) random variables with non identical distributions {F_1j(x), j ? 1}, {X_2j, j ? 1} is a sequence of independent identically distributed random variables, n₁(t) and n₂(t) are two positive integer-valued functions, and {N_i(t), t ? 0}²_{i = 1} with EN_i(t) = λ_i(t) are two counting processes independent of {X_ij, j ? 1}²_{i = 1}. Under several assumptions, some results of precise large deviations for non random difference and random difference are derived, and some corresponding results are extended.     

The jackknife procedure for the probabilities of misclassification

Seven estimators for the probabilities of misclassifi-cation associated with the linear discriminant function are considered. Four of them are known in the literature. The remaining three are constructed through the Jackknife Pro-cedure. An empirical investigation is conducted to evalu-ate the relative merits of these estimators. Summary of the results is presented.     

An almost sure central limit theorem for self-normalized partial sums of weakly dependent random variables

Abstract

We give here an almost sure central limit theorem for self-normalized partial sums of a strictly stationary φ-mixing sequences which is in the domain of attraction of the normal law with mean zero and possibly infinite variance. Our result substantially extend a result on the almost sure central limit theorem previously obtained by Huang and Pang (2010).     

Computational methods for complex stochastic systems: a review of some alternatives to MCMC

We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situations they can be difficult to implement; and suffer from problems such as poor mixing, and the difficulty of diagnosing convergence. Here we review three alternatives to MCMC methods: importance sampling, the forward-backward algorithm, and sequential Monte Carlo (SMC). We discuss how to design good proposal densities for importance sampling, show some of the range of models for which the forward-backward algorithm can be applied, and show how resampling ideas from SMC can be used to improve the efficiency of the other two methods. We demonstrate these methods on a range of examples, including estimating the transition density of a diffusion and of a discrete-state continuous-time Markov chain; inferring structure in population genetics; and segmenting genetic divergence data.     

Asymptotic tail behavior of a random sum with conditionally dependent subexponential summands

In this paper, we obtain some results for the asymptotic behavior of the tail probability of a random sum S_τ = ∑^τ_{k = 1}X_k, where the summands X_k, k = 1, 2, …, are conditionally dependent random variables with a common subexponential distribution F, and the random number τ is a non negative integer-valued random variable, independent of {X_k: k ? 1}.