Markov Chains and Mixing Times

Markov Chains and Mixing Times

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.
Country USA
Manufacturer American Mathematical Society
Binding Hardcover
ItemPartNumber 9781470429621
UnitCount 1
EANs 9781470429621
ReleaseDate 0000-00-00

Country	USA
Manufacturer	American Mathematical Society
Binding	Hardcover
ItemPartNumber	9781470429621
UnitCount	1
EANs	9781470429621
ReleaseDate	0000-00-00

Customers who purchased this also purchased....