Explicit Distributional Results In Pattern Formation II

The paper derives the joint generating function of a collection of pattern statistics associated with binary sequences. The models discussed cover independent and some dependent Bernoulli trials, including Markov dependent ones. The results cover, in particular, the moment generating function of the random search time for certain general binary patterns in the popular Knuth-Morris-Pratt algorithm and hence shed more light into its performance.     

A count data model for gamma waiting times

A new distribution for non-negative integers, or counts, is developed. It is based on the assumption that the waiting times separating consecutive events are independently and identically gamma distributed. Thus, the structural process generating the counts may exhibit duration dependence. In this framework, the frequently observed phenomenon of overdispersion, that is a variance that exceeds the mean, is caused by a decreasing hazard function of the gamma distributed waiting times, while an increasing hazard leads to underdispersion at the level of the counts. A Monte Carlo simulation and an application to fertility data illustrate the performance of the new distribution.     

Multi-class M/PH/1 queues with deterministic impatience times

This article considers computational procedures for the waiting time and queue length distributions in stationary multi-class first-come, first-served single-server queues with deterministic impatience times. There are several classes of customers, which are distinguished by deterministic impatience times (i.e., maximum allowable waiting times). We assume that customers in each class arrive according to an independent Poisson process and a single server serves customers on a first-come, first-served basis. Service times of customers in each class are independent and identically distributed according to a phase-type distribution that may differ for different classes. We first consider the stationary distribution of the virtual waiting time and then derive numerically feasible formulas for the actual waiting time distribution and loss probability. We also analyze the joint queue length distribution and provide an algorithmic procedure for computing the probability mass function of the stationary joint queue length.     

Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams

This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of customers may be different for different arrival streams. After briefly discussing the actual waiting time distributions of customers from respective arrival streams, we derive a formula for the vector generating function of the time-average joint queue length distribution in terms of the virtual waiting time distribution. Further assuming the discrete phase-type batch size distributions, we develop a numerically feasible procedure to compute the joint queue length distribution. Some numerical examples are provided also.     

Exact and asymptotic results for pattern waiting times

Waiting time problems for the occurrence of a pattern have attracted considerable research interest. Several results, including Poisson or Compound Poisson approximations as well as Normal approximations have appeared in the literature. In addition, a number of asymptotic results has been developed by making use of the finite Markov chain imbedding technique and the Perron–Frobenius eigenvalue. In the present paper we present a recursive scheme for the evaluation of the tail probabilities of the waiting time for the first and r-th occurrence of a pattern. A number of asymptotic results (along with their rates of convergence) that do not require the existence of the Perron–Frobenius eigenvalue are also offered. These results cover a quite wide class of pattern waiting time problems and, in most cases, perform better than the ones using the Perron–Frobenius eigenvalue.     

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.     

Joint distribution of rises,falls, and number of runs in random sequences

By using the matrix formulation of the two-step approach to the distributions of runs, a recursive relation and an explicit expression are derived for the generating function of the joint distribution of rises and falls for multivariate random sequences in terms of generating functions of individual letters, from which the generating functions of the joint distribution of rises, falls, and number of runs are obtained. An explicit formula for the joint distribution of rises and falls with arbitrary specification is also obtained.     

WAITING TIME IN THE COUPON-COLLECTOR'S PROBLEM1

The coupon collector's problem is generalized by allowing unequal proportions of the various types of coupons. The upper tail probabilities are used to find the probability distribution of the waiting time. The probability generating function is expressed in terms of the hypergeometric functions and therefrom the mean and the variance are derived.     

On the Gerber–Shiu discounted penalty function in a risk model with delayed claims

In this paper, we consider an extension to the continuous time risk model for which the occurrence of the claim may be delayed and the time of delay for the claim is assumed to be random. Two types of dependent claims, main claims and by-claims, are defined, where every by-claim is induced by the main claim. The time of occurrence of a by-claim is later than that of its associate main claim and the time of delay for the occurrence of a by-claim is random. An integro-differential equations system for the Gerber–Shiu discounted penalty function is established using the auxiliary risk models. Both the system of Laplace transforms of the Gerber–Shiu discounted penalty functions and the Gerber–Shiu discounted penalty functions with zero initial surplus are obtained. From Lagrange interpolating theorem, we prove that the Gerber–Shiu discounted penalty function satisfies a defective renewal equation. Exact representation for the solution of this equation is derived through an associated compound geometric distribution. Finally, examples are given with claim sizes that have exponential and a mixture of exponential distributions.     

On k-match problems

Several waiting time random variables for a duplication within a memory window of size k in a sequence of {1,2,…,m}-valued random variables are investigated. The exact distributions of the waiting time random variables are derived by the method of conditional probability generating functions. In particular, the exact distribution of the waiting time for the first k-match is obtained when the underlying sequence is generated by higher order Markov dependent trials. Examples for numerical calculations are also given.     

BMAP/G/1 Queue Under D-Policy: Queue Length Analysis

ABSTRACT

We study the queue length distribution of a queueing system with BMAP arrivals under D-policy. The idle server begins to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We derive the vector generating functions of the queue lengths both at a departure and at an arbitrary point of time. Mean queue lengths are derived and a numerical example is presented.     

Finite time ruin probability and structural density properties in the presence of dependence in insurance risk model

In the present paper, we consider the classical compound Poisson risk model with dependence between claim sizes and claim inter-arrival time. We attempt to analyze the approximation of finite time ruin probability. The finite time ruin probabilities are plotted for fixed threshold value associated to the claim inter-arrival time and also for fixed dependence parameter in Nelsen (2006) copula separately. Additionally, a general form for joint density of the interclaim times and claim sizes is considered. With respect to the classical Gerber-Shiu's (1998) function, first some structural density properties of dependent collective risk model is obtained. Then the ladder height probability density function of claim sizes is computed and the dependency structure investigated for Erlang interclaim time. As the application, some dependent models of the interclaim times and claim sizes are studied.     

Comparing waiting times in a multi-stage model: A log-rank approach

A proper log-rank test for comparing two waiting (i.e. sojourn, gap) times under right censored data has been absent in the survival literature. The classical log-rank test provides a biased comparison even under independent right censoring since the censoring induced on the time since state entry depends on the entry time unless the hazards are semi-Markov. We develop test statistics for comparing K waiting time distributions from a multi-stage model in which censoring and waiting times may be dependent upon the transition history in the multi-stage model. To account for such dependent censoring, the proposed test statistics utilize an inverse probability of censoring weighted (IPCW) approach previously employed to define estimators for the cumulative hazard and survival function for waiting times in multi-stage models. We develop the test statistics as analogues to K-sample log-rank statistics for failure time data, and weak convergence to a Gaussian limit is demonstrated. A simulation study demonstrates the appropriateness of the test statistics in designs that violate typical independence assumptions for multi-stage models, under which naive test statistics for failure time data perform poorly, and illustrates the superiority of the test under proportional hazards alternatives to a Mann–Whitney type test. We apply the test statistics to an existing data set of burn patients.     

Queue Length Analysis of MAP/G/1 Queue Under D-Policy

Abstract

We study the queue length distribution of a queueing system with MAP arrivals under D-policy. The idle server begins to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We derive the vector generating functions of the queue lengths both at a departure and at an arbitrary point of time. Mean queue lengths will be derived from these transform results. A numerical example is provided.     

On inference from Markov chain macro-data using transforms

We consider data that are longitudinal, arising from n individuals over m time periods. Each individual moves according to the same homogeneous Markov chain, with s states. If the individual sample paths are observed, so that ‘micro-data’ are available, the transition probability matrix is estimated by maximum likelihood straightforwardly from the transition counts. If only the overall numbers in the various states at each time point are observed, we have ‘macro-data’, and the likelihood function is difficult to compute. In that case a variety of methods has been proposed in the literature. In this paper we propose methods based on generating functions and investigate their performance.     

Simple expressions for a bivariate chisquare distribution

The joint distribution of the estimated variances from a correlated bivariate normal distribution has a long history. However, its joint probability density function, conditional moments and product moments are only known as infinite series. In this paper, simpler expressions, mostly finite sums of elementary functions, are derived for these properties. Expressions are also derived for the joint moment generating function and the joint characteristic function.     

Using panel methods to model waiting times for National Health Service surgery

Summary. Long waiting times for non-emergency (elective) procedures are a central feature of the UK's National Health Service, with about 1 million people waiting for surgery at any one time. This paper develops empirical models of the demand for and supply of elective surgery which simultaneously determine waiting times. The models are tested by using a panel of annual data for 5499 small areas from 1991 to 1998. Supply and demand functions are estimated for all specialties combined and for seven individual specialties, using panel data methods that incorporate simultaneously determined variables. The elasticity of demand with respect to waiting time varies between specialties but is always quite small. The results are discussed in the light of UK Government policy initiatives designed to reduce waiting times substantially. The analysis suggests that these initiatives will not stimulate demand markedly and therefore stand a good chance of succeeding provided that adequate additional resources are made available.     

NONPARAMETRIC STATISTICAL ANALYSIS OF DISCRETE-TIME QUEUES,WITH APPLICATIONS TO ATM TELETRAFFIC DATA

In this paper nonparametric statistical analysis of a discrete-time queueing system is considered. Estimation of performance measures of the system is studied. The attention is first focused on the estimation of the waiting time probability distribution, as well as of functionals of interest (mean waiting time, variance of the waiting time, etc.). The approach is based on the estimation of the corresponding generating function. Attention is paid to the estimation of the probability of a “long delay”, in view of its importance for applications. Results for possibly unstable models are also obtained. Finally, an application to ATM teletraffic data is provided.     

Application of trajectories from growth curve in identification of longitudinal biomarker for the multivariate survival data

In clinical studies, the researchers measure the patients' response longitudinally. In recent studies, Mixed models are used to determine effects in the individual level. In the other hand, Henderson et al. [3,4] developed a joint likelihood function which combines likelihood functions of longitudinal biomarkers and survival times. They put random effects in the longitudinal component to determine if a longitudinal biomarker is associated with time to an event. In this paper, we deal with a longitudinal biomarker as a growth curve and extend Henderson's method to determine if a longitudinal biomarker is associated with time to an event for the multivariate survival data.     

Estimating fecundability from data on waiting times to first conception

"This article tests assumptions invoked in the demographic literature to estimate the population distribution of fecundability from data on waiting times to first conception. In continuous time, the key assumption is that waiting times are realizations from a mixture of exponentials distribution. In discrete time, the key assumption is that waiting times are realizations from a mixture of geometrics distribution. The [U.S.] Hutterite data analyzed by Sheps (1965) are consistent with this assumption. Various models, however, have one representation in mixture of exponentials form. A fundamental identification problem plagues the conventional estimation procedure. Our analysis calls into question the conventional practice of checking model specification by using goodness-of-fit tests. The practical importance of the identification problem in duration models is demonstrated."