Tail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite

We consider the sums S _n =ξ₁+?+ξ _n of independent identically distributed random variables. We do not assume that the ξ's have a finite mean. Under subexponential type conditions on distribution of the summands, we find the asymptotics of the probability P{M>x} as x→∞, provided that M=sup {S _n ,n≥1} is a proper random variable. Special attention is paid to the case of tails which are regularly varying at infinity. We provide some sufficient conditions for the integrated weighted tail distribution to be subexponential. We supplement these conditions by a number of examples which cover both the infinite- and the finite-mean cases. In particular, we show that the subexponentiality of distribution F does not imply the subexponentiality of its integrated tail distribution F ^I.     

A note on the subexponential asymptotics of the stationary distribution of M/G/1 type Markov chains

Masuyama (2011) obtained the subexponential asymptotics of the stationary distribution of an M/G/1 type Markov chain under the assumption related to the periodic structure of G-matrix. In this note, we improve Masuyama’s result by showing that the subexponential asymptotics holds without the assumption related to the periodic structure of G-matrix.     

Multivariate subexponential distributions and their applications

We propose a new definition of a multivariate subexponential distribution. We compare this definition with the two existing notions of multivariate subexponentiality, and compute the asymptotic behaviour of the ruin probability in the context of an insurance portfolio, when multivariate subexponentiality holds. Previously such results were available only in the case of multivariate regularly varying claims.     

Tail asymptotics for the queue length in an M/G/1 retrial queue

In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and hence the stationary queue length in an M/G/1 retrial queue is subexponential if the stationary queue length in the corresponding M/G/1 queue is subexponential. Our results for subexponential tails also apply to regularly varying tails, and we provide the regularly varying tail asymptotics for the stationary queue length of the M/G/1 retrial queue. AMS subject classifications: 60J25, 60K25     

A heavy-traffic-limit formula for the moments of the stationary distribution in GI/G/1-type Markov chains

This paper studies the heavy-traffic limit of the moments of the stationary distribution in GI/G/1-type Markov chains. For these Markov chains, several researchers have derived heavy-traffic-limit formulas for the stationary distribution itself. However, for its moments, no such formulas have been reported in the literature. This paper presents a heavy-traffic-limit formula for the moments of the stationary distribution and a sufficient condition for the formula to hold, by using a characteristic function approach.     

批到达M/G/1重试排队的队长的尾渐近

用随机分解法研究成批到达服务时间为次指数分布的重试排队中队长的尾行为,得到了该系统与其相应的标准排队系统队长尾分布的关系;对次指数尾,结果也能用于正则变化尾,进而得到正则变化尾渐近．     

On Subexponential Distributions and Asymptotics of the Distribution of the Maximum of Sequential Sums

We study the properties of subexponential distributions and find new sufficient and necessary conditions for membership in the class of these distributions. We establish a connection between the classes of subexponential and semiexponential distributions and give conditions for preservation of the asymptotics of subexponential distributions for functions of distributions. We address similar problems for the class of the so-called locally subexponential distributions. As an application of these results, we refine the asymptotics of the distribution of the supremum of sequential sums of random variables with negative drift, in particular, local theorems.     

Tail asymptotics for M/G/1 type queueing processes with subexponential increments

Bivariate regenerative Markov modulated queueing processes {I _n ,L _n } are described. {I _n } is the phase process, and {L _n } is the level process. Increments in the level process have subexponential distributions. A general boundary behavior at the level 0 is allowed. The asymptotic tail of the cycle maximum, , during a regenerative cycle, , and the asymptotic tail of the stationary random variable L _∞, respectively, of the level process are given and shown to be subexponential with L _∞ having the heavier tail. This revised version was published online in June 2006 with corrections to the Cover Date.     

The Finite-time Ruin Probability of a Discrete-time Risk Model with Subexponential and Dependent Insurance and Financial Risks

Consider a discrete-time risk model with insurance and financial risks in a stochastic economic environment. Assume that the insurance and financial risks form a sequence of independent and identically distributed random vectors with a generic random vector following a wide type of dependence structure. An asymptotic formula for the finite-time ruin probability with subexponential insurance risks is derived. In doing so, the subexponentiality of the product of two dependent random variables is investigated simultaneously.     

一类常见次指数族的充分条件和必要条件

本文利用Cline和Samorodnitsky(1994)的方法,讨论了长尾分布族及其相关分布族的若干性质,在此基础上,分别获得了一类次指数分布族及其相关的分布族的充分条件和必要条件.     

H∞ control of a class of networked control systems with time delay and packet dropout

This paper studies the H-infinity control issue for a class of networked control systems (NCSs) with time delay and packet dropout. The state feedback closed-loop NCS is modeled as a discrete-time switched system. Through using a Lyapunov function, a sufficient condition is obtained, under which the system is exponential stability with a desired H-infinity disturbance attenuation level. The designed H-infinity controller is obtained by solving a set of linear matrix inequalities. An illustrative example is presented to demonstrate the effectiveness of the proposed method.     

Estimates for the Tail Probability of the Supremum of a Random Walk with Independent Increments

The authors investigate the tail probability of the supremum of a random walk with independent increments and obtain some equivalent assertions in the case that the increments are independent and identically distributed random variables with O-subexponential integrated distributions. A uniform upper bound is derived for the distribution of the supremum of a random walk with independent but non-identically distributed increments, whose tail distributions are dominated by a common tail distribution with an O-subexponential integrated distribution.     

Analysis of the GI/Geo/1 queue with N-policy

We consider a discrete-time single server N  -policy GI/Geo/1$\mathit{GI}/\mathit{Geo}/1$ queueing system. The server stops servicing whenever the system becomes empty, and resumes its service as soon as the number of waiting customers in the queue reaches N. Using an embedded Markov chain and a trial solution approach, the stationary queue length distribution at arrival epochs is obtained. Furthermore, we obtain the stationary queue length distribution at arbitrary epochs by using the preceding result and a semi-Markov process. The sojourn time distribution is also presented.     

A characterization of Q-polynomial association schemes

We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.     

Duality of dams via mountain processes

We consider a G/M/1-type dam having finite capacity and a general release rule, and construct a ‘dual’ M/G/1-type dam with state-dependent jump sizes and without dry periods whose content process has the same stationary density (up to some transformation). For the dual dam the stationary distribution can be computed in closed form.     

Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times

This paper considers a stable GI/GI/1 queue with subexponential service time distribution. Under natural assumptions we derive the tail behaviour of the busy period of this queue. We extend the results known for the regular variation case under minimal conditions. Our method of proof is based on a large deviations result for subexponential distributions.     

The extremal behaviour over regenerative cycles for Markov additive processes with heavy tails

We consider the reflection of an additive process with negative drift controlled by a Markov chain on a finite state space. We determine the tail behaviour of the distribution of the maximum over a regenerative cycle in the case with subexponential increments. Based on this, the asymptotic distribution of the running maximum is derived. Applications of the results to Markov modulated single server queueing systems are given.