GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES

A sufficient condition is proved for geometric decay of the steady-state probabilities in a quasi-birth-and-death process having a countable number of phases in each level. If there is a positive number η and positive vectors x = (x _i) and y = (y _j ) satisfying some equations and inequalities, the steady-state probability π _mi decays geometrically with rate η in the sense π _mi ～ cη ^m x _i as m → ∞. As an example, the result is applied to a two-queue system with shorter queue discipline.     

Tree Structured QBD Markov Chains and Tree‐Like QBD Processes

Abstract

In this paper, we show that an arbitrary tree structured quasi‐birth–death (QBD) Markov chain can be embedded in a tree‐like QBD process with a special structure. Moreover, we present an algebraic proof that applying the natural fixed point iteration (FPI) to the nonlinear matrix equation V = B + ∑ _s=1 ^d U _s (I ? V)^?1 D _s that solves the tree‐like QBD process, is equivalent to the more complicated iterative algorithm presented by Yeung and Alfa (1996).     

Commuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 Queues

Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and different representations for their stationary sojourn time and queue length distribution have been derived. More specifically, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queues. While QBD queues have a matrix exponential representation for their queue length and sojourn time distribution of order N and N², respectively, where N is the size of the background continuous time Markov chain, the reverse is true for a semi-Markovian queue. As the class of MAP/MAP/1 queues lies at the intersection, both the queue length and sojourn time distribution of a MAP/MAP/1 queue has an order N matrix exponential representation. The aim of this article is to understand why the order N² distributions of the sojourn time of a QBD queue and the queue length of a semi-Markovian queue can be reduced to an order N distribution in the specific case of a MAP/MAP/1 queue. We show that the key observation exists in establishing the commutativity of some fundamental matrices involved in the analysis of the MAP/MAP/1 queue.     

A note on efficient simulation of multidimensional spatial autoregressive processes

In applications of spatial statistics, it is necessary to compute the product of some matrix W of spatial weights and a vector y of observations. The weighting matrix often needs to be adapted to the specific problems, such that the computation of Wy cannot necessarily be done with available R-packages. Hence, this article suggests one possibility treating such issues. The proposed technique avoids the computation of the matrix product by calculating each entry of Wy separately. Initially, a specific spatial autoregressive process is introduced. The performance of the proposed program is briefly compared to a basic program using the matrix multiplication.     

A Spectral Method for a Nonpreemptive Priority BMAP/G/1 QUEUE

Abstract

In this paper we consider a nonpreemptive priority queue with two priority classes of customers. Customers arrive according to a batch Markovian arrival process (BMAP). In order to calculate the boundary vectors we propose a spectral method based on zeros of the determinant of a matrix function and the corresponding eigenvectors. It is proved that there are M zeros in a set Ω, where M is the size of the state space of the underlying Markov process. The zeros are calculated by the Durand-Kerner method, and the stationary joint probability of the numbers of customers of classes 1 and 2 at departures is derived by the inversion of the two-dimensional Fourier transform. For a numerical example, the stationary probability is calculated.     

The Waiting Time Distribution of a Type k Customer in a Discrete-Time MMAP[K]/PH[K]/c (c = 1, 2) Queue Using QBDs

Abstract

This paper presents an improved method to calculate the delay distribution of a type k customer in a first-come-first-serve (FCFS) discrete-time queueing system with multiple types of customers, where each type has different service requirements, and c servers, with c = 1, 2 (the MMAP[K]/PH[K]/c queue). The first algorithms to compute this delay distribution, using the GI/M/1 paradigm, were presented by Van Houdt and Blondia [Van Houdt, B.; Blondia, C. The delay distribution of a type k customer in a first come first served MMAP[K]/PH[K]/1 queue. J. Appl. Probab. 2002, 39 (1), 213–222; The waiting time distribution of a type k customer in a FCFS MMAP[K]/PH[K]/2 queue. Technical Report; 2002]. The two most limiting properties of these algorithms are: (i) the computation of the rate matrix R related to the GI/M/1 type Markov chain, (ii) the amount of memory needed to store the transition matrices A _l and B _l . In this paper we demonstrate that each of the three GI/M/1 type Markov chains used to develop the algorithms in the above articles can be reduced to a QBD with a block size which is only marginally larger than that of its corresponding GI/M/1 type Markov chain. As a result, the two major limiting factors of each of these algorithms are drastically reduced to computing the G matrix of the QBD and storing the 6 matrices that characterize the QBD. Moreover, these algorithms are easier to implement, especially for the system with c = 2 servers. We also include some numerical examples that further demonstrate the reduction in computational resources.     

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.     

Level-Phase Independence for Fluid Queues

ABSTRACT

A Markov-modulated fluid queue is a two-dimensional Markov process; the first dimension is continuous and is usually called the level, and the second is the state of a Markov process that determines the evolution of the level, it is usually called the phase. We show that it is always possible to modify the transition rules at the boundary level of the fluid queue in order to obtain independence between the level and the phase under the stationary distribution. We obtain this result by exploiting the similarity between fluid queues and Quasi-Birth-and-Death (QBD) processes.     

High breakdown point robust estimators with missing data

In this paper, we propose a new procedure to estimate the distribution of a variable y when there are missing data. To compensate the presence of missing responses, it is assumed that a covariate vector x is observed and that y and x are related by means of a semi-parametric regression model. Observed residuals are combined with predicted values to estimate the missing response distribution. Once the responses distribution is consistently estimated, we can estimate any parameter defined through a continuous functional T using a plug in procedure. We prove that the proposed estimators have high breakdown point.     

The group inverse of finite homogeneous QBD processes

Generalized inverses of I?P, where P is a stochastic matrix, play an important role in the theory of Markov chains. In particular, the group inverse (I?P)^# has a probabilistic interpretation and is well suited for algorithmic implementation. We determine (I?P)^# for finite homogeneous quasi-birth-and-death (QBD) processes by exploiting both the structure of the process and the probabilistic properties of the group inverse.     

Final outcome probabilities for SIR epidemic model

Abstract

We consider an SIR stochastic epidemic model in which new infections occur at rate f(x, y), where x and y are, respectively, the number of susceptibles and infectives at the time of infection and f is a positive sequence of real functions. A simple explicit formula for the final size distribution is obtained. Some efficient recursive methods are proved for the exact calculation of this distribution. In addition, we give a Gaussian approximation for the final distribution using a diffusion process approximation.     

A very simple proof of the multivariate Chebyshev's inequality

Abstract

In this short note, a very simple proof of the Chebyshev's inequality for random vectors is given. This inequality provides a lower bound for the percentage of the population of an arbitrary random vector X with finite mean μ = E(X) and a positive definite covariance matrix V = Cov(X) whose Mahalanobis distance with respect to V to the mean μ is less than a fixed value. The main advantage of the proof is that it is a simple exercise for a first year probability course. An alternative proof based on principal components is also provided. This proof can be used to study the case of a singular covariance matrix V.     

A Note on Multiple Regression for Single Index Model

Abstract

A simple method based on sliced inverse regression (SIR) is proposed to explore an effective dimension reduction (EDR) vector for the single index model. We avoid the principle component analysis step of the original SIR by using two sample mean vectors in two slices of the response variable and their difference vector. The theories become simpler, the method is equivalent to the multiple linear regression with dichotomized response, and the estimator can be expressed by a closed form, although the objective function might be an unknown nonlinear. It can be applied for the case when the number of covariates is large, and it requires no matrix operation or iterative calculation.     

Estimation of a Gamma Scale Parameter Under Asymmetric Squared Log Error Loss

Abstract

Estimation of scale parameter under the squared log error loss function is considered with restriction to the principle of invariance and risk unbiasedness. An explicit form of minimum risk scale-equivariant estimator under this loss is obtained. The admissibility and inadmissibility of a class of linear estimators of the form (cT + d) are considered, where T follows a gamma distribution with an unknown scale parameter η and a known shape parameter ν. This includes the admissibility of the minimum risk equivariant estimator on η (MRE).     

Generalized Sobol sensitivity indices for dependent variables: numerical methods

The hierarchically orthogonal functional decomposition of any measurable function η of a random vector X=(X₁,?…?, X_p) consists in decomposing η(X) into a sum of increasing dimension functions depending only on a subvector of X. Even when X₁,?…?, X_p are assumed to be dependent, this decomposition is unique if the components are hierarchically orthogonal. That is, two of the components are orthogonal whenever all the variables involved in one of the summands are a subset of the variables involved in the other. Setting Y=η(X), this decomposition leads to the definition of generalized sensitivity indices able to quantify the uncertainty of Y due to each dependent input in X [Chastaing G, Gamboa F, Prieur C. Generalized Hoeffding–Sobol decomposition for dependent variables – application to sensitivity analysis. Electron J Statist. 2012;6:2420–2448]. In this paper, a numerical method is developed to identify the component functions of the decomposition using the hierarchical orthogonality property. Furthermore, the asymptotic properties of the components estimation is studied, as well as the numerical estimation of the generalized sensitivity indices of a toy model. Lastly, the method is applied to a model arising from a real-world problem.     

Monitoring Multi-Attribute Processes Based on NORTA Inverse Transformed Vectors

Although multivariate statistical process control has been receiving a well-deserved attention in the literature, little work has been done to deal with multi-attribute processes. While by the NORTA algorithm one can generate an arbitrary multi-dimensional random vector by transforming a multi-dimensional standard normal vector, in this article, using inverse transformation method, we initially transform a multi-attribute random vector so that the marginal probability distributions associated with the transformed random variables are approximately normal. Then, we estimate the covariance matrix of the transformed vector via simulation. Finally, we apply the well-known T ² control chart to the transformed vector. We use some simulation experiments to illustrate the proposed method and to compare its performance with that of the deleted-Y method. The results show that the proposed method works better than the deleted-Y method in terms of the out-of-control average run length criterion.     

Orthogonal polynomials generated by random vectors

Every random q-vector with finite moments generates a set of orthonormal polynomials. These are generated from the basis functions xn = xn11…xnqq using Gram–Schmidt orthogonalization. One can cycle through these basis functions using any number of ways. Here, we give results using minimum cycling. The polynomials look simpler when centered about the mean of X, and still simpler form when X is symmetric about zero. This leads to an extension of the multivariate Hermite polynomial for a general random vector symmetric about zero. As an example, the results are applied to the multivariate normal distribution.