Finite Markov Chains and Algorithmic Applications (Paperback)

Olle Haggstrom

ISBN 10: 0521890012 / ISBN 13: 9780521890014

Editore: Cambridge University Press, Cambridge, 2002

Riguardo questo articolo

Paperback. Based on a lecture course given at Chalmers University of Technology, this book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Codice articolo 9780521890014

Dati bibliografici

• Titolo: Finite Markov Chains and Algorithmic Applications (Paperback)
• Editore: Cambridge University Press, Cambridge
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 0521890012
• ISBN 13: 9780521890014
• Rilegatura: Paperback
• Edizione: prima edizione
• Condizione: new

Descrizione articolo

Riassunto

In this 2002 book, the author develops the necessary background in probability theory and Markov chains then discusses important computing applications.

Recensione

'Has climbing up onto the MCMC juggernaut seemed to require just too much effort? This delightful little monograph provides an effortless way in. The chapters are bite-sized with helpful, do-able exercises (by virtue of strategically placed hints) that complement the text.' Publication of the International Statistical Institute

'... a very nice introduction to the modern theory of Markov chain simulation algorithms.' R. E. Maiboroda, Zentralblatt MATH

' ... 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

'This elegant little book is a beautiful introduction to the theory of simulation algorithms, using (discrete) Markov chains (on finite state spaces) ... highly recommended to anyone interested in the theory of Markov chain simulation algorithms.' Nieuw Archief voor Wiskunde