Customer Reviews

Finite Markov Chains and Algorithmic Applications (London Mathematical Society Student Texts)

5 star:		(2)
4 star:		(1)
3 star:		(0)
2 star:		(0)
1 star:		(0)

 

 

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.

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.

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.