Finite Markov Chains and Algorithmic Applications Export

@book{citeulike:1720148, abstract = {{This text is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before using it to study a range of randomized algorithms with important applications in optimization and other problems in computing. The book will appeal not only to mathematicians, but to students of computer science who will discover much useful material. This clear and concise introduction to the subject has numerous exercises that will help students to deepen their understanding.}}, author = {H\"{a}ggstr\"{o}m, Olle}, citeulike-article-id = {1720148}, citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0521890012}, citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21&path=ASIN/0521890012}, citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21&path=ASIN/0521890012}, citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0521890012}, citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0521890012/citeulike00-21}, citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0521890012}, citeulike-linkout-6 = {http://www.worldcat.org/isbn/0521890012}, citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0521890012}, citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0521890012&index=books&linkCode=qs}, citeulike-linkout-9 = {http://www.librarything.com/isbn/0521890012}, comment = {* Ch.6 reversible Markov chains * irreducible=>one stationary distribution ("since the chain is irreducible, we have by Theorem 5.3 and Footnote 15 in Chapter 5 that this is the only stationary distribution") * p.42 any "birth and death" process is reversible * hard-core model * p.69(80) telescoping trick for MCMC for colorings}, day = {15}, howpublished = {Paperback}, isbn = {0521890012}, keywords = {book, counting, markov-chains}, month = {August}, posted-at = {2008-01-12 22:29:00}, priority = {2}, publisher = {{Cambridge University Press}}, title = {Finite Markov Chains and Algorithmic Applications}, url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0521890012}, year = {2002} }

TY - BOOK ID - citeulike:1720148 L3 - citeulike-article-id:1720148 N2 - {This text is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before using it to study a range of randomized algorithms with important applications in optimization and other problems in computing. The book will appeal not only to mathematicians, but to students of computer science who will discover much useful material. This clear and concise introduction to the subject has numerous exercises that will help students to deepen their understanding.} SN - 0521890012 TI - Finite Markov Chains and Algorithmic Applications PB - {Cambridge University Press} KW - book KW - counting KW - markov-chains N1 - * Ch.6 reversible Markov chains * irreducible=>one stationary distribution ("since the chain is irreducible, we have by Theorem 5.3 and Footnote 15 in Chapter 5 that this is the only stationary distribution") * p.42 any "birth and death" process is reversible * hard-core model * p.69(80) telescoping trick for MCMC for colorings AU - Häggström, Olle PY - 2002/08/15/ UR - http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0521890012 ER -