Finite Markov Chains and Algorithmic Applications
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.
Available editions
Save this book
Save
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.
