IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-56666-0_16.html
   My bibliography  Save this book chapter

A New Combinatorial Algorithm for Large Markov Chains (Extended Abstract)

In: Computer Algebra in Scientific Computing CASC 2001

Author

Listed:
  • Anna Gambin

    (Warsaw University, Institute of Informatics)

  • Piotr Pokarowski

    (Warsaw University, Institute of Applied Mathematics)

Abstract

We consider large Markov chains which posses specific decomposable structure, the so called Nearly Completely Decomposable Chains (NCD chains). A new theoretical approach for approximate computations of NCD chains has been recently introduced in [11,12]. The method of forest expansions gives raise to aggregation algorithms, which approximate effectively the characteristics of Markov chain. The algorithms are based on grouping the states of a Markov chain in such a way that the probability of changing the state inside the group is of greater order of magnitude than interactions between groups. In [5] the algorithm approximating stationary distribution (described by transposed system L T x = b, where L is derived from transition matrix) was presented; in this paper we illustrate that combinatorial aggregation in the case of non-transposed system (defining e.g. mean hitting time) is not less effective. This novel approach allows us to treat both types of problems in the unified manner. To our knowledge for the first time an aggregation scheme was used to calculate Markov chain characteristics other than stationary distribution.

Suggested Citation

  • Anna Gambin & Piotr Pokarowski, 2001. "A New Combinatorial Algorithm for Large Markov Chains (Extended Abstract)," Springer Books, in: Victor G. Ganzha & Ernst W. Mayr & Evgenii V. Vorozhtsov (ed.), Computer Algebra in Scientific Computing CASC 2001, pages 195-211, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-56666-0_16
    DOI: 10.1007/978-3-642-56666-0_16
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-56666-0_16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.