The M/M/1 queue with mass exodus and mass arrivals when empty

1997 ◽  
Vol 34 (01) ◽  
pp. 192-207 ◽  
Author(s):  
Anyue Chen ◽  
Eric Renshaw
Keyword(s):  
Sufficient Conditions ◽  
High Order ◽  
Necessary And Sufficient Conditions ◽  
Positive Recurrence ◽  
Powerful Technique ◽  
Resolvent Approach ◽  
Necessary And Sufficient ◽  
Direct Attack

An M/M/1 queue is subject to mass exodus at rate β and mass immigration at rate when idle. A general resolvent approach is used to derive occupation probabilities and high-order moments. This powerful technique is not only considerably easier to apply than a standard direct attack on the forward p.g.f. equation, but it also implicitly yields necessary and sufficient conditions for recurrence, positive recurrence and transience.

The M/M/1 queue with mass exodus and mass arrivals when empty

1997 ◽  
Vol 34 (1) ◽  
pp. 192-207 ◽  
Author(s):  
Anyue Chen ◽  
Eric Renshaw
Keyword(s):  
Sufficient Conditions ◽  
High Order ◽  
Necessary And Sufficient Conditions ◽  
Positive Recurrence ◽  
Powerful Technique ◽  
Resolvent Approach ◽  
Necessary And Sufficient ◽  
Direct Attack

An M/M/1 queue is subject to mass exodus at rate β and mass immigration at rate when idle. A general resolvent approach is used to derive occupation probabilities and high-order moments. This powerful technique is not only considerably easier to apply than a standard direct attack on the forward p.g.f. equation, but it also implicitly yields necessary and sufficient conditions for recurrence, positive recurrence and transience.

scholarly journals Recurrence classification for a family of non-linear storage models

2018 ◽  
Vol 37 (2) ◽  
pp. 337-353
Author(s):  
Peter W. Glynn ◽  
Sanatan Rai ◽  
John E. Glynn
Keyword(s):  
Discrete Time ◽  
Power Law ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Storage Model ◽  
Positive Recurrence ◽  
Non Linear ◽  
Necessary And Sufficient ◽  
Recurrence Classification

RECURRENCE CLASSIFICATION FOR A FAMILY OF NON-LINEAR STORAGE MODELSNecessary and sufficient conditions for positive recurrence of a discrete-time non-linear storage model with power law dynamics arederived. In addition, necessary and sufficient conditions for finiteness of p-th stationary moments are obtained for this class of models.

scholarly journals High-Order Iterative Methods for the DMP Inverse

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Xiaoji Liu ◽  
Naping Cai
Keyword(s):  
Error Estimate ◽  
Iterative Methods ◽  
Sufficient Conditions ◽  
High Order ◽  
Necessary And Sufficient Conditions ◽  
Numerical Examples ◽  
Sufficient Conditions For Convergence ◽  
Necessary And Sufficient ◽  
High Order Iterative Methods

We investigate two iterative methods for computing the DMP inverse. The necessary and sufficient conditions for convergence of our schemes are considered and the error estimate is also derived. Numerical examples are given to test the accuracy and effectiveness of our methods.

Hendricks libraries and Tsetlin piles

1982 ◽  
Vol 14 (01) ◽  
pp. 37-55 ◽  
Author(s):  
Jacques-Edouard Dies
Keyword(s):  
Markov Chains ◽  
Large Class ◽  
Special Class ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Stationary Measure ◽  
Sufficient Condition ◽  
Positive Recurrence ◽  
Necessary And Sufficient

In order to study the transience of Hendricks libraries, we introduce and study a special class of Markov chains, the Tsetlin d-piles, generalizing Tsetlin libraries and briefly defined as follows: a 1-pile is a Tsetlin library and a d-pile is a Tsetlin library where each book is replaced by a (d − 1)-pile. We give a stationary measure of these chains and establish the necessary and sufficient conditions for positive recurrence and transience. Finally, the study of d-piles allows us to determine a sufficient condition for transience of quite a large class of Hendricks libraries.

Transience and recurrence of an interesting Markov chain

1974 ◽  
Vol 11 (04) ◽  
pp. 818-824 ◽  
Author(s):  
Gérard Letac
Keyword(s):  
Markov Chain ◽  
Natural Extension ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Positive Recurrence ◽  
Null Recurrence ◽  
A Chain ◽  
Necessary And Sufficient ◽  
Countable Case

This note studies the natural extension to the countable case of a chain considered by Hendricks (1972) and gives necessary and sufficient conditions for transience, null recurrence and positive recurrence.

On the ergodicity of a class of level-dependent quasi-birth-and-death processes

2019 ◽  
Vol 51 (4) ◽  
pp. 1109-1128
Author(s):  
James D. Cordeiro ◽  
Jeffrey P. Kharoufeh ◽  
Mark E. Oxley
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Asymptotic Convergence ◽  
Birth And Death Processes ◽  
Positive Recurrence ◽  
Qbd Processes ◽  
Group Inverses ◽  
Necessary And Sufficient

AbstractWe examine necessary and sufficient conditions for recurrence and positive recurrence of a class of irreducible, level-dependent quasi-birth-and-death (LDQBD) processes with a block tridiagonal structure that exhibits asymptotic convergence in the rows as the level tends to infinity. These conditions are obtained by exploiting a multi-dimensional Lyapunov drift approach, along with the theory of generalized Markov group inverses. Additionally, we highlight analogies to well-known average drift results for level-independent quasi-birth-and-death (QBD) processes.

scholarly journals Collective Coordination of High-Order Dynamic Multiagent Systems Guided by Multiple Leaders

2011 ◽  
Vol 2011 ◽  
pp. 1-11
Author(s):  
Xin-Lei Feng ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Second Order ◽  
High Order ◽  
Necessary And Sufficient Conditions ◽  
Numerical Examples ◽  
Necessary And Sufficient ◽  
Multiple Leaders ◽  
Theoretical Results

For second-order and high-order dynamic multiagent systems with multiple leaders, the coordination schemes that all the follower agents flock to the polytope region formed by multiple leaders are considered. Necessary and sufficient conditions which the follower agents can enter the polytope region by the leaders are obtained. Finally, numerical examples are given to illustrate our theoretical results.

Sign in / Sign up

Export Citation Format

Share Document