메뉴 건너뛰기




Volumn 27, Issue 2, 2006, Pages 396-412

Computing moments of first passage times to a subset of states in Markov chains

Author keywords

First passage times; Grassmann Taksar Heyman algorithm; Markov chains; Mean; Moments; Unsafe states; Variance

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; LINEAR SYSTEMS; METHOD OF MOMENTS; PROBLEM SOLVING;

EID: 33646230759     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479804442462     Document Type: Article
Times cited : (14)

References (23)
  • 1
    • 2942622561 scopus 로고    scopus 로고
    • The first Laurent series coefficients for singularly perturbed stochastic matrices
    • K. E. AVRACHENKOV AND M. HAVIV, The first Laurent series coefficients for singularly perturbed stochastic matrices, Linear Algebra Appl., 386 (2004), pp. 243-259.
    • (2004) Linear Algebra Appl. , vol.386 , pp. 243-259
    • Avrachenkov, K.E.1    Haviv, M.2
  • 4
    • 0000790476 scopus 로고    scopus 로고
    • On the effects of using the Grassmann-Taksar-Heyman method in iterative aggregation-disaggregation
    • T. DAYAR AND W. J. STEWART, On the effects of using the Grassmann-Taksar-Heyman method in iterative aggregation-disaggregation, SIAM J. Sci. Comput., 17 (1996), pp. 287-303.
    • (1996) SIAM J. Sci. Comput. , vol.17 , pp. 287-303
    • Dayar, T.1    Stewart, W.J.2
  • 6
    • 0022131573 scopus 로고
    • Regenerative analysis and steady state distributions for Markov chains
    • W. K. GRASSMANN, M. I. TAKSAR, AND D. P. HEYMAN, Regenerative analysis and steady state distributions for Markov chains, Oper. Res., 33 (1985), pp. 1107-1116.
    • (1985) Oper. Res. , vol.33 , pp. 1107-1116
    • Grassmann, W.K.1    Taksar, M.I.2    Heyman, D.P.3
  • 8
    • 0001671939 scopus 로고
    • Comparison of some direct methods for computing the stationary distributions of Markov chains
    • W. J. HARROD AND R. J. PLEMMONS, Comparison of some direct methods for computing the stationary distributions of Markov chains, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 453-469.
    • (1984) SIAM J. Sci. Statist. Comput. , vol.5 , pp. 453-469
    • Harrod, W.J.1    Plemmons, R.J.2
  • 9
    • 0007390892 scopus 로고
    • Mean passage times and nearly uncoupled Markov chains
    • R. HASSIN AND M. HAVIV, Mean passage times and nearly uncoupled Markov chains, SIAM J. Discrete Math., 5 (1992), pp. 386-397.
    • (1992) SIAM J. Discrete Math. , vol.5 , pp. 386-397
    • Hassin, R.1    Haviv, M.2
  • 10
    • 21844515710 scopus 로고
    • Accurate computation of the fundamental matrix of a Markov chain
    • D. P. HEYMAN, Accurate computation of the fundamental matrix of a Markov chain, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 954-963.
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 954-963
    • Heyman, D.P.1
  • 11
    • 0002767576 scopus 로고
    • What is fundamental for Markov chains: First passage times, fundamental matrices, and group generalized inverses
    • W. J. Stewart, ed., Kluwer, Boston, MA
    • D. P. HEYMAN AND D. P. O'LEARY, What is fundamental for Markov chains: First passage times, fundamental matrices, and group generalized inverses, in Computations with Markov Chains, W. J. Stewart, ed., Kluwer, Boston, MA, 1995, pp. 151-161.
    • (1995) Computations with Markov Chains , pp. 151-161
    • Heyman, D.P.1    O'Leary, D.P.2
  • 12
    • 0347038897 scopus 로고    scopus 로고
    • Overcoming instability in computing the fundamental matrix for a Markov chain
    • D. P. HEYMAN AND D. P. O'LEARY, Overcoming instability in computing the fundamental matrix for a Markov chain, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 534-540.
    • (1998) SIAM J. Matrix Anal. Appl. , vol.19 , pp. 534-540
    • Heyman, D.P.1    O'Leary, D.P.2
  • 16
    • 0037399643 scopus 로고    scopus 로고
    • Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II. Fast convergence
    • I. MAREK, Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II. Fast convergence, Appl. Numer. Math., 45 (2003), pp. 11-28.
    • (2003) Appl. Numer. Math. , vol.45 , pp. 11-28
    • Marek, I.1
  • 17
    • 0016534380 scopus 로고
    • The role of the group generalized inverse in the theory of finite Markov chains
    • C. D. MEYER, JR., The role of the group generalized inverse in the theory of finite Markov chains, SIAM Rev., 17 (1975), pp. 443-464.
    • (1975) SIAM Rev. , vol.17 , pp. 443-464
    • Meyer Jr., C.D.1
  • 18
    • 0024680811 scopus 로고
    • Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems
    • C. D. MEYER, Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems, SIAM Rev., 31 (1989), pp. 240-272.
    • (1989) SIAM Rev. , vol.31 , pp. 240-272
    • Meyer, C.D.1
  • 19
    • 21144460955 scopus 로고
    • Entrywise perturbation theory and error analysis for Markov chains
    • C. A. O'CINNEIDE, Entrywise perturbation theory and error analysis for Markov chains, Numer. Math., 65 (1993), pp. 109-120.
    • (1993) Numer. Math. , vol.65 , pp. 109-120
    • O'Cinneide, C.A.1
  • 20
    • 4043124470 scopus 로고
    • Computation of the stationary distribution of a Markov chain
    • C. C. PAIGE, P. H. STYAN, AND P. G. WACHTER, Computation of the stationary distribution of a Markov chain, J. Stat. Comput. Simul., 4 (1975), pp. 1156-1179.
    • (1975) J. Stat. Comput. Simul. , vol.4 , pp. 1156-1179
    • Paige, C.C.1    Styan, P.H.2    Wachter, P.G.3
  • 22
    • 0022704334 scopus 로고
    • Calculating cumulative operational time distributions of repairable computer systems
    • E. DE SOUZA E SILVA AND H. R. GAIL, Calculating cumulative operational time distributions of repairable computer systems, IEEE Trans. Comput., C-35 (1986), pp. 322-332.
    • (1986) IEEE Trans. Comput. , vol.C-35 , pp. 322-332
    • De Souza E Silva, E.1    Gail, H.R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.