Computing mean first passage times for a Markov chain (Q4359981): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/0020739950260510 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092536437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing absorption probabilities for a Markov chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced System Algorithms for Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713483 / rank
 
Normal rank

Latest revision as of 18:27, 27 May 2024

scientific article; zbMATH DE number 1076790
Language Label Description Also known as
English
Computing mean first passage times for a Markov chain
scientific article; zbMATH DE number 1076790

    Statements

    Identifiers