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. / Series: Forschungsberichte / Institut für Statistik
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_a17 |
| Date | January 1992 |
| Creators | Böhm, Walter, Jain, J. L., Mohanty, Sri Gopal |
| Publisher | Department of Statistics and Mathematics, WU Vienna University of Economics and Business |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Paper, NonPeerReviewed |
| Format | application/pdf |
| Relation | http://epub.wu.ac.at/1356/ |
Page generated in 0.0019 seconds