Approximating probabilities of first passage in a particular gaussian process

Shepp (1971) derives the distribution of waiting times of first passage for a particular Gaussian process. However, Shepp notes that for moderate to large waiting tines the expressions for the probability cannot be evaluated either numerically or by asymptotic estimation. Me present a useful approximation for the distribution and expected waiting time for the conditional and unconditional versions of this first passage problem. The probabilities play a role in bounds by Adler (1984) for the probability distribution of the supremum of a particular two-parameter Gaussian field, a detection problem (Lai, 197 3) and the study of signal shape problems in radars (Zakai Ziv, 1969).     

Analysis of dependently truncated data in Cox framework

Truncation is a known feature of bone marrow transplant (BMT) registry data, for which the survival time of a leukemia patient is left truncated by the waiting time to transplant. It was recently noted that a longer waiting time was linked to poorer survival. A straightforward solution is a Cox model on the survival time with the waiting time as both truncation variable and covariate. The Cox model should also include other recognized risk factors as covariates. In this article, we focus on estimating the distribution function of waiting time and the probability of selection under the aforementioned Cox model.     

Approximating M/G/1 Waiting Time Tail Probabilities

Abstract

We propose a new approximation formula for the waiting time tail probability of the M/G/1 queue with FIFO discipline and unlimited waiting space. The aim is to address the difficulty of obtaining good estimates when the tail probability has non-exponential asymptotics. We show that the waiting time tail probability can be expressed in terms of the waiting time tail probability of a notional M/G/1 queue with truncated service time distribution plus the tail probability of an extreme order statistic. The Cramér–Lundberg approximation is applied to approximate the tail probability of the notional queue. In essence, our technique extends the applicability of the Cramér–Lundberg approximation to cases where the standard Lundberg condition does not hold. We propose a simple moment-based technique for estimating the parameters of the approximation; numerical results demonstrate that our approximation can yield very good estimates over the whole range of the argument.     

Simultaneous arrival of customers to two different queues and modeling dependence via copula approach

ABSTRACT

In classical queueing systems, a customer is allowed to wait only in one queue to receive the service. In practice, when there exist a number of queues rendering the same service, some customers may tend to simultaneously take turn in more than one queue with the aim to receive the service sooner and thus reduce their waiting time. In this article, we introduce such a model and put forward a methodology to deal with the situation. In this regard, we consider two queues and assume that if a customer, who has turn in both queues, receives the service from one of the queues, the other turn is automatically withdrawn. This circumstance for the model brings about some abandonment in each queue as some customers receive the service from the other one. We study the customer’s waiting time in the mentioned model, which is defined as the minimum of waiting times in both queues and obtain probability density function of this random variable. Our approach to obtain probability density function of each of the waiting time random variables is to rely on the existing results for the abandonment case. We examine the situation for the cases of independence and dependence of the waiting time random variables. The latter is treated via a copula approach.     

Discrete time cold standby repairable system: Combinatorial analysis

ABSTRACT

In this article, we obtain exact expression for the distribution of the time to failure of discrete time cold standby repairable system under the classical assumptions that both working time and repair time of components are geometric. Our method is based on alternative representation of lifetime as a waiting time random variable on a binary sequence, and combinatorial arguments. Such an exact expression for the time to failure distribution is new in the literature. Furthermore, we obtain the probability generating function and the first two moments of the lifetime random variable.     

On Level Crossing Analysis of Queues

In this note we introduce a new level crossing analysis and using it derive an integral equation for the steady state waiting time in the GI/G/1 Queue. For the GI/M/1 queue we derive the rates of up- and down-crossings of the virtual delay process and two integral equations, one for the steady state time spent in the system and the other for the steady state waiting time in the queue. Also, the steady state probability distributions of the time spent in the system and the waiting time in the queue are obtained by solving these integral equations.     

Extremal limit theorems for observations separated by random power law waiting times

This paper develops extreme value theory for random observations separated by random waiting times whose exceedence probability falls off like a power law. In the case where the waiting times between observations have an infinite mean, a limit theorem is established, where the limit is comprised of an extremal process whose time index is randomized according to the non-Markovian hitting time process for a stable subordinator. The resulting limit distributions are shown to be solutions of fractional differential equations, where the order of the fractional time derivative coincides with the power law index of the waiting time. The probability that the limit process remains below a threshold is also computed. For waiting times with finite mean but infinite variance, a two-scale argument yields a fundamentally different limit process. The resulting limit is an extremal process whose time index is randomized according to the first passage time of a positively skewed stable Lévy motion with positive drift. This two-scale limit provides a second-order correction to the usual limit behavior.     

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.     

On discrete distributions generated from drawing balls with bivariate labels

In this article, we consider urn models under three types of sampling schemes in terms of the probability-generating functions. The tools are developed for the evaluation of the distributions arising from the urn models along with some examples. Furthermore, the distributions are investigated by making use of the Bell polynomials. The results presented here provide a wide framework for developing the theory of urn models. As examples, we propose new class of probability models, which are called multiple-player problems and examine their properties. Finally, we treat the parameter estimation problem in the waiting time distributions with a numerical example.     

Some classes of distributions and their application in queueing

New classes of distributions are defined in analogy to the properties NBU, NBUE known from reliability. They are applied to obtain bounds on certain parameters of the GI/G/1 queue, such as the mean and the variance of the stationary waiting time, the probability of waiting, and the covariances of waiting times.     

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.     

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.     

Matrix–geometric analysis of the discrete time Gi/G/1 system

In this paper, we show that the discrete GI/G/1 system can be analysed as a QBD process with infinite blocks. Most importantly, we show that Matrix–geometric method can be used for analyzing this general queue system including establishing its stability criterion and for obtaining the explicit stationary probability and the waiting time distributions. This also settles the unwritten myth that Matrix–geometric method is limited to cases with at least one Markov based characterizing parameter, i.e. either interarrival or service times, in the case of queueing systems.     

A Retrial Queue with a Constant Retrial Rate,Server Downs and Impatient Customers

ABSTRACT

In this paper, we consider a retrial queueing system consisting of a waiting line of infinite capacity in front of a single server subject to breakdowns. A customer upon arrival may join the queue (waiting line) or go to the retrial orbit (another queue) to retry for service after a random time. Only the customer at the head of the retrial orbit is allowed to retry for service. Upon retrial, the customer enters the service if the server is idle; otherwise, it may go back to the retrial orbit or leave the system (become impatient). All the interarrival times, service times, server up times, server down times and retrial times are exponential, and all the necessary independence conditions in these variables are assumed. For this system, we provide sufficient conditions under which, for any given number of customers in the orbit, the stationary probability of the number of customers in the waiting line decays geometrically. We also provide explicitly an expression for the decay parameter.     

ANALYSIS OF A GI/G Y /1 SYSTEM IN DISCRETE-TIME

ABSTRACT

We consider a class of single server queueing systems in which customers arrive singly and service is provided in batches, depending on the number of customers waiting when the server becomes free. Service is independent of the batch size. This system could also be considered as a batch service queue in which a server visits the queue at arbitrary times and collects a batch of waiting customers for service, or waits for a customer to arrive if there are no waiting customers. A waiting server immediately collects and processes the first arriving customer. The system is considered in discrete time. The interarrival times of customers and the inter-visit times of the server, which we call the service time, have general distributions and are represented as remaining time Markov chains. We analyze this system using the matrix-geometric method and show that the resulting R matrix can be determined explicitly in some special cases and the stationary distributions are known semi-explicitly in some other special cases.     

A Conway Maxwell Poisson type generalization of the negative hypergeometric distribution

Abstract

Negative hypergeometric distribution arises as a waiting time distribution when we sample without replacement from a finite population. It has applications in many areas such as inspection sampling and estimation of wildlife populations. However, as is well known, the negative hypergeometric distribution is over-dispersed in the sense that its variance is greater than the mean. To make it more flexible and versatile, we propose a modified version of negative hypergeometric distribution called COM-Negative Hypergeometric distribution (COM-NH) by introducing a shape parameter as in the COM-Poisson and COMP-Binomial distributions. It is shown that under some limiting conditions, COM-NH approaches to a distribution that we call the COM-Negative binomial (COMP-NB), which in turn, approaches to the COM Poisson distribution. For the proposed model, we investigate the dispersion characteristics and shape of the probability mass function for different combinations of parameters. We also develop statistical inference for this model including parameter estimation and hypothesis tests. In particular, we investigate some properties such as bias, MSE, and coverage probabilities of the maximum likelihood estimators for its parameters by Monte Carlo simulation and likelihood ratio test to assess shape parameter of the underlying model. We present illustrative data to provide discussion.     

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."     

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.     

The E-Bayesian and hierarchical Bayesian estimations for the system reliability parameter

Han introduced an E-Bayesian estimation method for estimating a system failure probability and revealed the relationship between the E-Bayesian estimates under three different prior distributions of hyperparameters in 2007. In this article, formulas of the hierarchical Bayesian estimation of a system failure probability are investigated and, furthermore, the relationship between hierarchical Bayesian estimation and E-Bayesian estimation is discussed. Finally, numerical example and application example are provided for illustrative purpose.     

Modelling and analysis of recall-based competing risks data

In this paper we consider the analysis of recall-based competing risks data. The chance of an individual recalling the exact time to event depends on the time of occurrence of the event and time of observation of the individual. In particular, it is assumed that the probability of recall depends on the time elapsed since the occurrence of an event. In this study we consider the likelihood-based inference for the analysis of recall-based competing risks data. The likelihood function is constructed by incorporating the information about the probability of recall. We consider the maximum likelihood estimation of parameters. Simulation studies are carried out to examine the performance of the estimators. The proposed estimation procedure is applied to a real life data set.