Logo

Markov Chains and Mixing Times

Large book cover: Markov Chains and Mixing Times

Markov Chains and Mixing Times
by

Publisher: American Mathematical Society
ISBN/ASIN: 0821847392
ISBN-13: 9780821847398
Number of pages: 387

Description:
This book is an introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary distribution as a function of the size and geometry of the state space. The authors develop the key tools for estimating convergence times, including coupling, strong stationary times, and spectral methods.

Home page url

Download or read it online for free here:
Download link
(4.5MB, PDF)

Similar books

Book cover: Random Matrix Models and Their ApplicationsRandom Matrix Models and Their Applications
by - Cambridge University Press
The book covers broad areas such as topologic and combinatorial aspects of random matrix theory; scaling limits, universalities and phase transitions in matrix models; universalities for random polynomials; and applications to integrable systems.
(16944 views)
Book cover: Probability and Statistics: A Course for Physicists and EngineersProbability and Statistics: A Course for Physicists and Engineers
by - De Gruyter Open
This is an introduction to concepts of probability theory, probability distributions relevant in the applied sciences, as well as basics of sampling distributions, estimation and hypothesis testing. Designed for students in engineering and physics.
(8753 views)
Book cover: Basic Data Analysis and More: A Guided Tour Using PythonBasic Data Analysis and More: A Guided Tour Using Python
by - arXiv
In these lecture notes, a selection of frequently required statistical tools will be introduced and illustrated. They allow to post-process data that stem from, e.g., large-scale numerical simulations (aka sequence of random experiments).
(15062 views)
Book cover: Reversible Markov Chains and Random Walks on GraphsReversible Markov Chains and Random Walks on Graphs
by - University of California, Berkeley
From the table of contents: General Markov Chains; Reversible Markov Chains; Hitting and Convergence Time, and Flow Rate, Parameters for Reversible Markov Chains; Special Graphs and Trees; Cover Times; Symmetric Graphs and Chains; etc.
(14787 views)