Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs (Q513241)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6691785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs |
scientific article; zbMATH DE number 6691785 |
Statements
Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs (English)
0 references
3 March 2017
0 references
Markov chain
0 references
mean first passage time
0 references
stochastic matrix
0 references
directed graph
0 references
Hessenberg matrix
0 references
0 references
0.780819833278656
0 references
0.780505359172821
0 references
0.7649459838867188
0 references
0.7588903903961182
0 references
0.7581866979598999
0 references
