 |
GetTextbooks.com
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Finite Markov Chains and Algorithmic Applications by Olle Häggström ISBN-10: 9780521813570 ISBN-10: 0-521-81357-3 ISBN-13: 9780521813570 ISBN-13: 978-0-521-81357-0 Hardcover 2002-08-15 Cambridge University Press Find Lowest Price |
Editorials | ||
Product Description 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. | ||
Book Description 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. | ||
Reviews | ||
Brilliant! This book is nothing short of brilliant. The pace is 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. | ||
Excellent introduction This is a very clearly written, succinct introduction to Markov Chains (it does not aim to be exhaustive). 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. | ||
Well suited for courses in Markov chains Markov chains, a sequence of actions with a random element, can be applied to nearly any process that is composed of discrete steps. Such processes include manufacturing operations, building large structures and even visiting web sites on the Internet. This book is a set of lecture notes for a course for advanced undergraduates offered by the author. It begins with a basic introduction to probability theory and covers some applications of Markov chains that I had never thought about, such as surfing the Internet. There are exercises at the end of each section although solutions are not included. With a section on computer simulation of Markov chains, the book could also be used in a special topics course in computer science, where the emphasis is on optimization. Markov chains are a valuable tool that should receive more emphasis in the education of math and computer science students. This book can serve as a basic text for classes aimed at both types of student. | ||