A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain
| dc.contributor.author | Hunt, E. | |
| dc.date.issued | 2004 | |
| dc.description | Copyright © 2004 Australian Mathematical Society This paper is made available with the permission of the Australian Mathematical Society Inc. | |
| dc.description.abstract | An efficient probabilistic algorithm is presented for the determination of the rate matrix of a blockGI=M=1 Markov chain. Recurrence of the chain is not assumed. | |
| dc.description.statementofresponsibility | Emma Hunt | |
| dc.identifier.citation | Australia and New Zealand Industrial and Applied Mathematics (ANZIAM) Journal, 2004; 45:457-475 | |
| dc.identifier.issn | 1446-1811 | |
| dc.identifier.uri | http://hdl.handle.net/2440/316 | |
| dc.language.iso | en | |
| dc.publisher | Australian Mathematical Society | |
| dc.source.uri | http://www.austms.org.au/Publ/Jamsb/V45P4/1987.html | |
| dc.title | A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain | |
| dc.type | Journal article | |
| pubs.publication-status | Published |
Files
Original bundle
1 - 1 of 1