Tree formulas, mean first passage times and Kemeny's constant of a Markov chain (Q1697037): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1240476
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jim W. Pitman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.09017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098569369 / rank
 
Normal rank

Latest revision as of 09:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
scientific article

    Statements

    Tree formulas, mean first passage times and Kemeny's constant of a Markov chain (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2018
    0 references
    As the authors note, they offer some probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. This paper is largely a review, and it contains a number of interesting and important formulas and algorithms for finite discrete-time Markov chains.
    0 references
    Cayley's formula
    0 references
    Green tree formula
    0 references
    harmonic tree formula
    0 references
    Kemeny's constant
    0 references
    Kirchhoff's matrix tree theorem
    0 references
    Markov chain tree theorem
    0 references
    mean first passage times
    0 references
    spanning forests/trees
    0 references
    Wilson's algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references