<p>bookname:finite markov chains and algrithmics</p><p>author:olle haggstrom</p><p>page:122</p><p>format:pdf</p><p>content:</p><p>Preface<br/>page vii<br/>1&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Basics of probability theory<br/>1<br/>2&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Markov chains<br/>8<br/>3&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Computer simulation of Markov chains<br/>17<br/>4&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Irreducible and aperiodic Markov chains<br/>23<br/>5&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Stationary distributions<br/>28<br/>6&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Reversible Markov chains<br/>39<br/>7&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Markov chain Monte Carlo<br/>45<br/>8&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Fast convergence of MCMC algorithms<br/>54<br/>9&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Approximate counting<br/>64<br/>10&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; The Propp–Wilson algorithm<br/>76<br/>11&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Sandwiching<br/>84<br/>12&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Propp–Wilson with read-once randomness<br/>93<br/>13&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Simulated annealing<br/>99<br/>14&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Further reading<br/>108<br/>References<br/>110<br/>Index<br/>113</p><p></p><p>
</p><p><br/>&nbsp;</p>
扫码加好友，拉您进群
全部版块
我的主页
收藏
