On Zero avoiding Transition Probabilities of an r-node Tandem Queue - a Combinatorial Approach

Walter Böhm, J. L. Jain, Sri Gopal Mohanty

Publikation: Working/Discussion PaperWU Working Paper

7 Downloads (Pure)


In this paper we present a simple combinatorial approach for the derivation of zero avoiding transition probabilities in a Markovian r- node series Jackson network. The method we propose offers two advantages: first, it is conceptually simple because it is based on transition counts between the nodes and does not require a tensor representation of the network. Second, the method provides us with a very efficient technique for numerical computation of zero avoiding transition probabilities.
HerausgeberDepartment of Statistics and Mathematics, WU Vienna University of Economics and Business
PublikationsstatusVeröffentlicht - 1992


ReiheForschungsberichte / Institut für Statistik

WU Working Paper Reihe

  • Forschungsberichte / Institut für Statistik