{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:05Z","timestamp":1725491645080},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540353621"},{"type":"electronic","value":"9783540353652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11777830_10","type":"book-chapter","created":{"date-parts":[[2006,6,19]],"date-time":"2006-06-19T15:21:04Z","timestamp":1150730464000},"page":"138-147","source":"Crossref","is-referenced-by-count":0,"title":["On the Convergence Rate of Quasi Lumpable Markov Chains"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Farag\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1137\/S0895479895294277","volume":"18","author":"T. Dayar","year":"1997","unstructured":"Dayar, T., Stewart, W.J.: Quasi Lumpability, Lower Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains. SIAM J. Matrix Anal. Appl.\u00a018, 482\u2013498 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-5316(94)90015-9","volume":"20","author":"G. Franceschinis","year":"1994","unstructured":"Franceschinis, G., Muntz, R.R.: Bounds for Quasi-Lumpable Markov Chains. Performance Evaluation\u00a020, 223\u2013243 (1994)","journal-title":"Performance Evaluation"},{"key":"10_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0094586","volume-title":"Markov Set-Chains","author":"D.J. Hartfiel","year":"1998","unstructured":"Hartfiel, D.J.: Markov Set-Chains. Lecture Notes in Mathematics, vol.\u00a01695. Springer, Heidelberg (1998)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0024-3795(93)90261-L","volume":"195","author":"D.J. Hartfiel","year":"1993","unstructured":"Hartfiel, D.J.: Results on Limiting Sets of Markov Set-Chains. Linear Algebra and its Applications\u00a0195, 155\u2013163 (1993)","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1214\/aoap\/1177005872","volume":"1","author":"F.P. Kelly","year":"1991","unstructured":"Kelly, F.P.: Loss Networks. Annals of Applied Probability\u00a01(3), 319\u2013378 (1991)","journal-title":"Annals of Applied Probability"},{"key":"10_CR6","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand Reinhold, New York (1960) (Later editions: Springer, 1976, 1983)"},{"key":"10_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3132-0","volume-title":"Markov Processes for Stochastic Modeling","author":"M. Kijima","year":"1997","unstructured":"Kijima, M.: Markov Processes for Stochastic Modeling. Chapman & Hall, Boca Raton (1997)"},{"key":"10_CR8","unstructured":"Lee, C.P.-C., Golub, G.H., Zenios, S.A.: A Fast Two-Stage Algorithm for Computing PageRank and Its Extensions, Technical Report SCCM-2003-15, Scientific Computation and Computational Mathematics, Stanford University, Stanford, CA (2003)"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(94)90293-3","volume":"125","author":"G. Louth","year":"1994","unstructured":"Louth, G., Mitzenmacher, M., Kelly, F.P.: Computational Complexity of Loss Networks. Theoretical Computer Science\u00a0125, 45\u201359 (1994)","journal-title":"Theoretical Computer Science"},{"key":"10_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting","author":"A. Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting. Birkh\u00e4user, Boston (1993)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Stochastic Models for Performance Evaluation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11777830_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:38Z","timestamp":1619507738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11777830_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540353621","9783540353652"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11777830_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}