Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. Finite Markov Chains and Algorithmic Applications
  • Cited by 225
Publisher:
Cambridge University Press
Online publication date:
March 2010
Print publication year:
2002
Online ISBN:
9780511613586
DOI:
https://doi.org/10.1017/CBO9780511613586
Subjects:
Mathematics (general), Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Applied Probability and Stochastic Networks, Statistics and Probability
Series:
London Mathematical Society Student Texts (52)
Information

Book description

Based on a lecture course given at Chalmers University of Technology, this 2002 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.

Reviews

‘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.’

Source: Publication of the International Statistical Institute

‘… a very nice introduction to the modern theory of Markov chain simulation algorithms.’

R. E. Maiboroda Source: 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.'

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

Source: Nieuw Archief voor Wiskunde

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.