On the Exponential Decay Rate of the Tail of a Discrete Probability Distribution

Abstract

We give a sufficient condition for the exponential decay of the tail of a discrete probability distribution π = (π _n ) _n≥0 in the sense that lim _n→∞(1/n) log∑ _i>n π _i  = ?θ with 0 < θ < ∞. We focus on analytic properties of the probability generating function of a discrete probability distribution, especially, the radius of convergence and the number of poles on the circle of convergence. Furthermore, we give an example of an M/G/1 type Markov chain such that the tail of its stationary distribution does not decay exponentially.     

Strong Gaussian Approximations of Product-Limit and Quantile Processes for Strong Mixing and Censored Data

In this article, we consider the product-limit quantile estimator of an unknown quantile function under a censored dependent model. This is a parallel problem to the estimation of the unknown distribution function by the product-limit estimator under the same model. Simultaneous strong Gaussian approximations of the product-limit process and product-limit quantile process are constructed with rate O[(log n)^?λ] for some λ > 0. The strong Gaussian approximation of the product-limit process is then applied to derive the laws of the iterated logarithm for product-limit process.     

A Strong Invariance Theorem of the Tail Empirical Copula Processes

We study the behavior of bivariate empirical copula process 𝔾 _n (·, ·) on pavements [0, k _n /n]² of [0, 1]², where k _n is a sequence of positive constants fulfilling some conditions. We provide a upper bound for the strong approximation of 𝔾 _n (·, ·) by a Gaussian process when k _n /n↘γ as n → ∞, where 0 ≤ γ ≤1.     

Integral Representation of a Distribution Associated with a Pure Birth Process

ABSTRACT

This article deals with a distribution associated with a pure birth process starting with no individuals, with birth rates λ _n  = λ for n = 0, 2,…, m ? 1 and λ _n  = μ for n ≥ m. The probability mass function is expressed in terms of an integral that is very convenient for computing probabilities, moments, generating functions, and others. Using this representation, the kth factorial moments of the distribution is obtained. Some other forms of this distribution are also given.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

Computing the conditional stationary distribution in Markov chains of level-dependent M/G/1-type

This paper considers the computation of the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, given that the level is not greater than a predefined threshold. This problem has been studied recently and a computational algorithm is proposed under the assumption that matrices representing downward jumps are nonsingular. We first show that this assumption can be eliminated in a general setting of Markov chains of level-dependent G/G/1-type. Next we develop a computational algorithm for the conditional stationary distribution in Markov chains of level-dependent M/G/1-type, by modifying the above-mentioned algorithm slightly. In principle, our algorithm is applicable to any Markov chain of level-dependent M/G/1-type, if the Markov chain is irreducible and positive-recurrent. Furthermore, as an input to the algorithm, we can set an error bound for the computed conditional distribution, which is a notable feature of our algorithm. Some numerical examples are also provided.     

Testing linear hypotheses in high-dimensional regressions

For a multivariate linear model, Wilk's likelihood ratio test (LRT) constitutes one of the cornerstone tools. However, the computation of its quantiles under the null or the alternative hypothesis requires complex analytic approximations, and more importantly, these distributional approximations are feasible only for moderate dimension of the dependent variable, say p≤20. On the other hand, assuming that the data dimension p as well as the number q of regression variables are fixed while the sample size n grows, several asymptotic approximations are proposed in the literature for Wilk's Λ including the widely used chi-square approximation. In this paper, we consider necessary modifications to Wilk's test in a high-dimensional context, specifically assuming a high data dimension p and a large sample size n. Based on recent random matrix theory, the correction we propose to Wilk's test is asymptotically Gaussian under the null hypothesis and simulations demonstrate that the corrected LRT has very satisfactory size and power, surely in the large p and large n context, but also for moderately large data dimensions such as p=30 or p=50. As a byproduct, we give a reason explaining why the standard chi-square approximation fails for high-dimensional data. We also introduce a new procedure for the classical multiple sample significance test in multivariate analysis of variance which is valid for high-dimensional data.     

On a Confidence Interval for the Mean of an Asymmetric Distribution

A clarification is given of the main result (1.1) in Communications in Statistics: Theory and Methods 34:753–766. The term {1 + 6a(r ? a)}^1/3 is to be understood as sgn(1 + 6a(r ? a)) | 1 + 6a(r ? a)|^1/3. The result is expressed in a more user-friendly form. An issue is raised regarding the common usage of the expression x ^1/n when n is even.     

The Distribution of Sums of Certain I.I.D. Pareto Variates

ABSTRACT

Though the Pareto distribution is important to actuaries and economists, an exact expression for the distribution of the sum of n i.i.d. Pareto variates has been difficult to obtain in general. This article considers Pareto random variables with common probability density function (pdf) f(x) = (α/β) (1 + x/β)^α+1 for x > 0, where α = 1,2,… and β > 0 is a scale parameter. To date, explicit expressions are known only for a few special cases: (i) α = 1 and n = 1,2,3; (ii) 0 < α < 1 and n = 1,2,…; and (iii) 1 < α < 2 and n = 1,2,…. New expressions are provided for the more general case where β > 0, and α and n are positive integers. Laplace transforms and generalized exponential integrals are used to derive these expressions, which involve integrals of real valued functions on the positive real line. An important attribute of these expressions is that the integrands involved are non oscillating.     

Approximate and estimated saddlepoint approximations

Classical saddlepoint methods, which assume that the cumulant generating function is known, result in an approximation to the distribution that achieves an error of order O(n^?1). The authors give a general theorem to address the accuracy of saddlepoint approximations in which the cumulant generating function has been estimated or approximated. In practice, the resulting saddlepoint approximations are typically of the order O(n^?1/2). The authors give simulation results for small sample examples to compare estimated saddlepoint approximations.     

Explicit Formulae for the Queue Length Distribution of Batch Arrival Systems

Abstract

A G ^θ I/G/1-type batch arrival system is considered. Explicit formulae for the distribution of queue length both at the fixed time t and as t → ∞ are obtained. The study is based on the generalization of Korolyuk's method for semi-markov random walks.     

A simple approximation relation between the symmetric generalized logistic and the students t distributions

In this paper, we obtain a new approximation of the Student's t distribution by using the symmetric generalized logistic (SGL) distribution function. The error of this approximation is shown to be 0(1/n² )where nis the degrees of freedom of thetdistribution. In comparison to similar approximations by George and Ojo and George et al. (1986), this new approximation is much simpler and more accurate. It is also shown that under some conditions, the tdistribution is a good approximation of the SGL distribution. Therefore, the complicated expressions for the cumulants and moments of the SGL can be approximated by those of the t, distribution. Finally, numerical results are given.     

Bayesian prediction of waiting times in stochastic models

The authors show how saddlepoint techniques lead to highly accurate approximations for Bayesian predictive densities and cumulative distribution functions in stochastic model settings where the prior is tractable, but not necessarily the likelihood or the predictand distribution. They consider more specifically models involving predictions associated with waiting times for semi‐Markov processes whose distributions are indexed by an unknown parameter θ. Bayesian prediction for such processes when they are not stationary is also addressed and the inverse‐Gaussian based saddlepoint approximation of Wood, Booth & Butler (1993) is shown to accurately deal with the nonstationarity whereas the normal‐based Lugannani & Rice (1980) approximation cannot, Their methods are illustrated by predicting various waiting times associated with M/M/q and M/G/1 queues. They also discuss modifications to the matrix renewal theory needed for computing the moment generating functions that are used in the saddlepoint methods.     

On the Distribution of Matrix Quadratic Forms

A characterization of the distribution of the multivariate quadratic form given by X A X′, where X is a p × n normally distributed matrix and A is an n × n symmetric real matrix, is presented. We show that the distribution of the quadratic form is the same as the distribution of a weighted sum of non central Wishart distributed matrices. This is applied to derive the distribution of the sample covariance between the rows of X when the expectation is the same for every column and is estimated with the regular mean.     

A new look at Markov processes of G/M/1-type

We present a new method for deriving the stationary distribution of an ergodic Markov process of G/M/1-type in continuous-time, by deriving and making use of a new representation for each element of the rate matrices contained in these distributions. This method can also be modified to derive the Laplace transform of each transition function associated with Markov processes of G/M/1-type.     

Methods for calculating stationary distribution in linear models of time series

The article deals with methods for computing the stationary marginal distribution in linear models of time series. Two approaches are described. First, an algorithm based on approximation of solution of the corresponding integral equation is briefly reviewed. Then, we study the limit behaviour of the partial sums c ₁ η₁+c ₂ η₂+···+c _n η _n where η _i are i.i.d. random variables and c _i real constants. We generalize procedure of Haiman (1998) [Haiman, G., 1998, Upper and lower bounds for the tail of the invariant distribution of some AR(1) processes. Asymptotic Methods in Probability and Statistics, 45, 723–730.] to an arbitrary causal linear process and relax the assumptions of his result significantly. This is achieved by investigating the properties of convolution of densities.