Based on a lecture course given at Chalmers University of Technology, this book is suitable for advanced undergraduate and beginning graduate students in statistics and computer science, and for mathematicians. Necessary background in probability theory and Markov chains is developed, then applied to the study of a range of randomized algorithms with applications on optimization and other problems in computing. Algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recently developed Propp Wilson algorithm.

Authors: Häggström O.  Pages: 125 Year: 2002 
Tags: algorithmic chains finite markov applications   Customers who bought this item also bought: 