- Series: London Mathematical Society Student Texts (Book 52)
- Paperback: 126 pages
- Publisher: Cambridge University Press; 1 edition (June 10, 2002)
- Language: English
- ISBN-10: 0521890012
- ISBN-13: 978-0521890014
- Product Dimensions: 6 x 0.3 x 9 inches
- Shipping Weight: 8.6 ounces (View shipping rates and policies)
- Average Customer Review: 2 customer reviews
- Amazon Best Sellers Rank: #2,002,821 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Finite Markov Chains and Algorithmic Applications (London Mathematical Society Student Texts) 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
Frequently bought together
Customers who bought this item also bought
"...extremely elegant...I am sure that students will find great pleasure in using the book--and that teachers will have the same pleasure in using it to prepare a course on the subject." Mathematics of Computation
"Here Haggstrom takes the beginning student from the first definitions concerning Markov chains even beyond Propp-Wilson to its refinementss and applications, all in just a hundred or so generously detailed pages. If an undergraduate reading this book comes away saying "I should have thought of that!" then the psychological barrier between school mathematics and research will have begun to break down. Few mathematical monographs provide a comparable opportunity. General readers; lower-division undergraduates through professionals." Choice
"[This series] is generally good....The use of examples to introduce the various algorithms is especially effective and makes the text easier to read." Mathematical Reviews
"The numerous examples perfectly well illustrate the more theoretical points. I am sure that students will find great pleasure in using the book-and that teachers will have the same pleasure in using it to prepare a course on the subject." Mathematics of Computation
Based on a lecture course given at Chalmers University, this book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory before applying it to study a range of randomised algorithms that have important applications in computing. This book will appeal not only to mathematicians, but to students of computer science who will find much here that appeals. This is a clear and concise introduction to this subject and the numerous exercises included will help students to deepen their understanding.
Top customer reviews
I think this book offers one of the most accessible and efficient routes to learning the basics about markov chain monte carlo, perfect simulation,sandwiching and simulated annealing.
I enjoyed this book a lot.Better to read this a few times and do the questions, and then if you must, tackle one of the more bloated expositions.
relaxed and discplined at the same time, the examples
are interesting, and the coverage surprisingly extensive
for its mere 124 pages. The idea to present Markov chains
in the context of algorithms and applications is innovative
and very useful. There is no other book of its kind.