Flowgraph Models for Generalized Phase Type Distributions Having Non-Exponential Waiting Times

ABSTRACT. Aalen (1995) introduced phase type distributions based on Markov processes for modelling disease progression in survival analysis. For tractability and to maintain the Markov property, these use exponential waiting times for transitions between states. This article extends the work of Aalen (1995) by generalizing these models to semi-Markov processes with non-exponential waiting times. The generalization allows more realistic modelling of the stages of a disease where the Markov property and exponential waiting times may not hold. Flowgraph models are introduced to provide a closed form for the distributions in situations involving non-exponential waiting times. Flowgraph models work where traditional methods of stochastic processes are intractable. Saddlepoint approximations are used in the analysis. Together, generalized phase type distributions, flowgraphs, and saddlepoint approximations create exciting and innovative prospects for the analysis of survival data.     

Bootstrapping survival times in stochastic systems by using saddlepoint approximations

The single bootstrap is implemented by using a saddlepoint approximation to determine estimates for the survival and hazard functions of first-passage times in complicated semi-Markov processes. The double bootstrap is also implemented by resampling saddlepoint inversions and provides BC_a confidence bands for these functions. Confidence intervals for the mean and variance of first-passage times are easily computed. A new characterization of the asymptotic hazard rate for survival times is presented and leads to an indirect method for constructing its bootstrap confidence interval.     

An empirical saddlepoint approximation based method for smoothing survival functions under right censoring

The Kaplan–Meier (KM) estimator is ubiquitously used for estimating survival functions, but it provides only a discrete approximation at the observation times and does not deliver a proper distribution if the largest observation is censored. Using KM as a starting point, we devise an empirical saddlepoint approximation‐based method for producing a smooth survival function that is unencumbered by choice of tuning parameters. The procedure inverts the moment generating function (MGF) defined through a Riemann–Stieltjes integral with respect to an underlying mixed probability measure consisting of the discrete KM mass function weights and an absolutely continuous exponential right‐tail completion. Uniform consistency, and weak and strong convergence results are established for the resulting MGF and its derivatives, thus validating their usage as inputs into the saddlepoint routines. Relevant asymptotic results are also derived for the density and distribution function estimates. The performance of the resulting survival approximations is examined in simulation studies, which demonstrate a favourable comparison with the log spline method (Kooperberg & Stone, 1992) in small sample settings. For smoothing survival functions we argue that the methodology has no immediate competitors in its class, and we illustrate its application on several real data sets. The Canadian Journal of Statistics 47: 238–261; 2019 © 2019 Statistical Society of Canada     

A uniform saddlepoint expansion for the null‐distribution of the wilcoxon‐mann‐whitney statistic

The authors give the exact coefficient of 1/N in a saddlepoint approximation to the Wilcoxon‐Mann‐Whitney null‐distribution. This saddlepoint approximation is obtained from an Edgeworth approximation to the exponentially tilted distribution. Moreover, the rate of convergence of the relative error is uniformly of order O (1/N) in a large deviation interval as defined in Feller (1971). The proposed method for computing the coefficient of 1/N can be used to obtain the exact coefficients of 1/Nⁱ, for any i. The exact formulas for the cumulant generating function and the cumulants, needed for these results, are those of van Dantzig (1947‐1950).     

Sample Size and Power Calculations for Left-Truncated Normal Distribution

Abstract

Sample size calculation is an important component in designing an experiment or a survey. In a wide variety of fields—including management science, insurance, and biological and medical science—truncated normal distributions are encountered in many applications. However, the sample size required for the left-truncated normal distribution has not been investigated, because the distribution of the sample mean from the left-truncated normal distribution is complex and difficult to obtain. This paper compares an ad hoc approach to two newly proposed methods based on the Central Limit Theorem and on a high degree saddlepoint approximation for calculating the required sample size with the prespecified power. As shown by use of simulations and an example of health insurance cost in China, the ad hoc approach underestimates the sample size required to achieve prespecified power. The method based on the high degree saddlepoint approximation provides valid sample size and power calculations, and it performs better than the Central Limit Theorem. When the sample size is not too small, the Central Limit Theorem also provides a valid, but relatively simple tool to approximate that sample size.     

Saddlepoint Approximation for Sample and Bootstrap Quantiles

The paper gives the saddlepoint approximation for the distribution function of the sample quantile. A comparison of the saddlepoint approximations for the distribution functions of the sample quantile and the bootstrap quantile shows that the error of the bootstrap approximation to the distribution of the sample quantile obtained by Singh (1981) as an absolute error is actually a relative error.     

Objective Bayesian Analysis of Skew‐t Distributions

Abstract. We study the Jeffreys prior and its properties for the shape parameter of univariate skew‐t distributions with linear and nonlinear Student's t skewing functions. In both cases, we show that the resulting priors for the shape parameter are symmetric around zero and proper. Moreover, we propose a Student's t approximation of the Jeffreys prior that makes an objective Bayesian analysis easy to perform. We carry out a Monte Carlo simulation study that demonstrates an overall better behaviour of the maximum a posteriori estimator compared with the maximum likelihood estimator. We also compare the frequentist coverage of the credible intervals based on the Jeffreys prior and its approximation and show that they are similar. We further discuss location‐scale models under scale mixtures of skew‐normal distributions and show some conditions for the existence of the posterior distribution and its moments. Finally, we present three numerical examples to illustrate the implications of our results on inference for skew‐t distributions.     

Saddlepoint approximations for subordinator processes

ABSTRACT

We develop the saddlepoint approximations in obtaining the transition functions for general subordinator processes. We derive explicit expressions of the first- and second-order approximations. Specifically, we consider some particular classes of subordinators including the Poisson processes, the Gamma processes, the α-stable subordinators, and the Poisson random integrals. We test this technique on the Poisson and Gamma processes, which have closed-form transition functions. Outcomes show that the approximate expressions are consistent with the true transition functions. We then use this method to predict transition density functions for the α-stable subordinator processes. Finally, we calculate approximated transition densities for some Poisson random integrations. Numerical analysis shows the perfect ability of the saddlepoint approximations to predict the transition densities of the α-stable processes and the Poisson random integrations.     

Asymptotic approximations to the distribution of Kendall's sample τ

This paper provides a saddlepoint approximation to the distribution of the sample version of Kendall's τ, which is a measure of association between two samples. The saddlepoint approximation is compared with the Edgeworth and the normal approximations, and with the bootstrap resampling distribution. A numerical study shows that with small sample sizes the saddlepoint approximation outperforms both the normal and the Edgeworth approximations. This paper gives also an analytical comparison between approximated and exact cumulants of the sample Kendall's τ when the two samples are independent.     

Estimation with the generalized exponential distribution based on record values and inter-record times

The maximum likelihood and Bayesian approaches have been considered for the two-parameter generalized exponential distribution based on record values with the number of trials following the record values (inter-record times). The maximum likelihood estimates are obtained under the inverse sampling and the random sampling schemes. It is shown that the maximum likelihood estimator of the shape parameter converges in mean square to the true value when the scale parameter is known. The Bayes estimates of the parameters have been developed by using Lindley's approximation and the Markov Chain Monte Carlo methods due to the lack of explicit forms under the squared error and the linear-exponential loss functions. The confidence intervals for the parameters are constructed based on asymptotic and Bayesian methods. The Bayes and the maximum likelihood estimators are compared in terms of the estimated risk by the Monte Carlo simulations. The comparison of the estimators based on the record values and the record values with their corresponding inter-record times are performed by using Monte Carlo simulations.     

SMALL SAMPLE INFERENCE IN LOCATION SCALE MODELS WITH STUDENT(λ) ERRORS

ABSTRACT

A third order accurate approximation to the p value in testing either the location or scale parameter in a location scale model with Student(λ) errors is introduced. The third order approximation is developed via an asymptotic method, based on exponential models and the saddlepoint approximation. Techniques are presented for the numerical computation of all quantities required for the third order approximation. To compare the accuracy of various asymptotic methods a numerical example and simulation study are included. The numerical example and simulation study illustrate that the third order method presented leads to a more accurate p value approximation compared to first order methods in Student(λ) models with small samples.     

Log‐rank permutation tests for trend: saddlepoint p‐values and survival rate confidence intervals

Suppose p + 1 experimental groups correspond to increasing dose levels of a treatment and all groups are subject to right censoring. In such instances, permutation tests for trend can be performed based on statistics derived from the weighted log‐rank class. This article uses saddlepoint methods to determine the mid‐P‐values for such permutation tests for any test statistic in the weighted log‐rank class. Permutation simulations are replaced by analytical saddlepoint computations which provide extremely accurate mid‐P‐values that are exact for most practical purposes and almost always more accurate than normal approximations. The speed of mid‐P‐value computation allows for the inversion of such tests to determine confidence intervals for the percentage increase in mean (or median) survival time per unit increase in dosage. The Canadian Journal of Statistics 37: 5‐16; 2009 © 2009 Statistical Society of Canada     

Saddlepoint density and distribution functions for the ratio of two linear functions and the product of generalized gamma variates

The generalized gamma distribution is a flexible and attractive distribution because it incorporates several well-known distributions, i.e., gamma, Weibull, Rayleigh, and Maxwell. This article derives saddlepoint density and distribution functions for the ratio of two linear functions of generalized gamma variables and the product of n independent generalized gamma variables. Simulation studies are used to evaluate the accuracy of the saddlepoint approximations. The saddlepoint approximations are fast, easy, and very accurate.     

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.     

Saddlepoint approximations for some models of circular data

In this article we provide saddlepoint approximations for some important models of circular data. The particularity of these saddlepoint approximations is that they do not require solving the saddlepoint equation iteratively, so their evaluation is immediate. We first give very accurate approximations to P-values, critical values and power functions for some optimal tests regarding the concentration parameter under wrapped symmetric α-stable and circular normal models. Then, we consider an approximation to the distribution of a projection of the two-dimensional Pearson random walk with exponential step sizes.     

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.     

Improved Measures of the Spread of Data for Some Unknown Complex Distributions Using Saddlepoint Approximations

Measures of the spread of data for random sums arise frequently in many problems and have a wide range of applications in real life, such as in the insurance field (e.g., the total claim size in a portfolio). The exact distribution of random sums is extremely difficult to determine, and normal approximation usually performs very badly for this complex distributions. A better method of approximating a random-sum distribution involves the use of saddlepoint approximations.

Saddlepoint approximations are powerful tools for providing accurate expressions for distribution functions that are not known in closed form. This method not only yields an accurate approximation near the center of the distribution but also controls the relative error in the far tail of the distribution.

In this article, we discuss approximations to the unknown complex random-sum Poisson–Erlang random variable, which has a continuous distribution, and the random-sum Poisson-negative binomial random variable, which has a discrete distribution. We show that the saddlepoint approximation method is not only quick, dependable, stable, and accurate enough for general statistical inference but is also applicable without deep knowledge of probability theory. Numerical examples of application of the saddlepoint approximation method to continuous and discrete random-sum Poisson distributions are presented.     

Saddlepoint p-values for group of linear rank tests

Many nonparametric tests in one sample problem, matched pairs, and competingrisks under censoring have the same underlying permutation distribution. This article proposes a saddlepoint approximation to the exact p-values of these tests instead of the asymptotic approximations. The performance of the saddlepoint approximation is assessed by using simulation studies that show the superiority of the saddlepoint methods over the asymptotic approximations in several settings. The use of the saddlepoint to approximate the p-values of class of two sample tests under complete randomized design is also discussed.     

M‐estimation for general ARMA Processes with Infinite Variance

Abstract. General autoregressive moving average (ARMA) models extend the traditional ARMA models by removing the assumptions of causality and invertibility. The assumptions are not required under a non‐Gaussian setting for the identifiability of the model parameters in contrast to the Gaussian setting. We study M‐estimation for general ARMA processes with infinite variance, where the distribution of innovations is in the domain of attraction of a non‐Gaussian stable law. Following the approach taken by Davis et al. (1992) and Davis (1996) , we derive a functional limit theorem for random processes based on the objective function, and establish asymptotic properties of the M‐estimator. We also consider bootstrapping the M‐estimator and extend the results of Davis & Wu (1997) to the present setting so that statistical inferences are readily implemented. Simulation studies are conducted to evaluate the finite sample performance of the M‐estimation and bootstrap procedures. An empirical example of financial time series is also provided.     

Saddlepoint Approximations to the Limiting Distribution of the Modified Anderson–Darling Test Statistic

The approximation for the distribution function of test statistic is extremely important in statistics. The standard and higher-order saddlepoint approximations are considered in tails of the limiting distribution for the modified Anderson–Darling test. The saddlepoint approximations are compared with the approximation of Sinclair et al. (1990 Sinclair , C. D. , Spurr , B. D. , Ahmad , M. I. ( 1990 ). Modified Anderson Darling test . Communication Statistics—Theory and Methods 19 : 3677 – 3686 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) for upper tail area. An empirical function is derived to estimate the critical values of a saddlepoint approximation.