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: CK-12 Basic Probability and Statistics: A Short CourseCK-12 Basic Probability and Statistics: A Short Course
by - CK-12.org
CK-12 Foundation's Basic Probability and Statistics– A Short Course is an introduction to theoretical probability and data organization. Students learn about events, conditions, random variables, and graphs and tables that allow them to manage data.
(14573 views)
Book cover: Bayesian Spectrum Analysis and Parameter EstimationBayesian Spectrum Analysis and Parameter Estimation
by - Springer
This work is a research document on the application of probability theory to the parameter estimation problem. The people who will be interested in this material are physicists, economists, and engineers who have to deal with data on a daily basis.
(11246 views)
Book cover: Statistics, Probability, and Game Theory: papers in honor of David BlackwellStatistics, Probability, and Game Theory: papers in honor of David Blackwell
by - IMS
The bulk of the articles in this volume are research articles in probability, statistics, gambling, game theory, Markov decision processes, set theory and logic, comparison of experiments, games of timing, merging of opinions, etc.
(7714 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.
(8612 views)