Updating the Stationary Vector of an Irreducible Markov Chain

by: With A Eye

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

ansobol, pferguson, mukundn, donade, gane5h

Find related articles with these CiteULike tags

aggregation-disaggregation, algorithm, google, linearalgebra, linear-algebra, markov-chain, no-tag, pagerank, stochastic-complementation, updating

Abstract

An iterative algorithm based on aggregation/disaggregation principles is presented for updating the stationary distribution of a finite homogeneous irreducible Markov chain. The focus is on largescale problems of the kind that are characterized by Google's PageRank application, but the algorithm is shown to work well in general contexts. The algorithm is flexible in that it allows for changes to the transition probabilities as well as for the creation or deletion of states. In addition to...

@misc{citeulike:331089, abstract = {An iterative algorithm based on aggregation/disaggregation principles is presented for updating the stationary distribution of a finite homogeneous irreducible Markov chain. The focus is on largescale problems of the kind that are characterized by Google's PageRank application, but the algorithm is shown to work well in general contexts. The algorithm is flexible in that it allows for changes to the transition probabilities as well as for the creation or deletion of states. In addition to...}, author = {Eye, With A. }, citeulike-article-id = {331089}, keywords = {linearalgebra, pagerank}, posted-at = {2006-03-24 16:48:52}, priority = {2}, title = {Updating the Stationary Vector of an Irreducible Markov Chain}, url = {http://citeseer.ist.psu.edu/721228.html} }

RIS record

TY - GEN ID - citeulike:331089 L3 - citeulike-article-id:331089 TI - Updating the Stationary Vector of an Irreducible Markov Chain N2 - An iterative algorithm based on aggregation/disaggregation principles is presented for updating the stationary distribution of a finite homogeneous irreducible Markov chain. The focus is on largescale problems of the kind that are characterized by Google's PageRank application, but the algorithm is shown to work well in general contexts. The algorithm is flexible in that it allows for changes to the transition probabilities as well as for the creation or deletion of states. In addition to... KW - linearalgebra KW - pagerank AU - Eye, With UR - http://citeseer.ist.psu.edu/721228.html ER -

RIS BibTeX