• Libraries
    • Log in to:
    View Item 
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Directed Forests and the Constancy of Kemeny's Constant

    Thumbnail
    View/Open
    combinatorial_kemeny_final.pdf (282.4Kb)
    Date
    2019-11-02
    Author
    Kirkland, Steve
    Metadata
    Show full item record
    Abstract
    Consider a discrete-time, time-homogeneous Markov chain on states 1, ... , n whose transition matrix is irreducible. A result of Kemeny reveals that the expected number of steps needed to arrive at a randomly chosen destination state starting from state j is (surprisingly) independent of the initial state j. In this note, we consider Kemeny's result from the perspective of algebraic combinatorics, and provide an intuitive explanation for its independence on the initial state j. The all minors matrix tree theorem is the key tool employed.
    URI
    http://hdl.handle.net/1993/37176
    DOI
    10.1007/s10801-019-00919-1
    Collections
    • University of Manitoba Scholarship [1981]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of MSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV