Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs (Q513241)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs
scientific article

    Statements

    Minimising the largest mean first passage time of a Markov chain: the influence of directed graphs (English)
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    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