Markov Chains and Mixing Times

·
· MBK 第 107 冊 · American Mathematical Soc.
電子書
447
頁數
評分和評論未經驗證 瞭解詳情

關於這本電子書

This book is an introduction to the modern theory of Markov chains, whose goal is to determine the rate of convergence to the stationary distribution, as a function of state space size and geometry. This topic has important connections to combinatorics, statistical physics, and theoretical computer science. Many of the techniques presented originate in these disciplines.

The central tools for estimating convergence times, including coupling, strong stationary times, and spectral methods, are developed. The authors discuss many examples, including card shuffling and the Ising model, from statistical mechanics, and present the connection of random walks to electrical networks and apply it to estimate hitting and cover times.

The first edition has been used in courses in mathematics and computer science departments of numerous universities. The second edition features three new chapters (on monotone chains, the exclusion process, and stationary times) and also includes smaller additions and corrections throughout. Updated notes at the end of each chapter inform the reader of recent research developments.

 

關於作者

David A. Levin: University of Oregon, Eugene, OR,
Yuval Peres: Microsoft Research, Redmond, WA

為這本電子書評分

請分享你的寶貴意見。

閱讀資訊

智能手機和平板電腦
請安裝 Android 版iPad/iPhone 版「Google Play 圖書」應用程式。這個應用程式會自動與你的帳戶保持同步,讓你隨時隨地上網或離線閱讀。
手提電腦和電腦
你可以使用電腦的網絡瀏覽器聆聽在 Google Play 上購買的有聲書。
電子書閱讀器及其他裝置
如要在 Kobo 等電子墨水裝置上閱覽書籍,你需要下載檔案並傳輸到你的裝置。請按照說明中心的詳細指示,將檔案傳輸到支援的電子書閱讀器。