Markov Chains and Mixing Times
List price: $67.00
Buy it from $66.13
This item qualifies for FREE shipping
*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: This text is an introduction to the modern approach to the theory of Markov chains. The main goals 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.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $67.00
Copyright year: 2008
Publisher: American Mathematical Society
Publication date: 12/9/2008
Size: 7.25" wide x 10.25" long x 1.00" tall
|Introduction to finite Markov chains|
|Classical (and useful) Markov chains|
|Markov chain Monte Carlo: Metropolis and Glauber chains|
|Introduction to Markov chain mixing|
|Coupling Strong stationary times|
|Lower bounds on mixing times|
|The symmetric group and shuffling cards|
|Random walks on networks Hitting times|
|Cover times Eigenvalues|
|Eigenfunctions and comparison of chains|
|The transportation metric and path coupling|
|The Ising model From shuffling cards to shuffling genes|
|Martingales and evolving sets|
|The cut-off phenomenon|
|Lamplighter walks Continuous-time chains|
|Countable state-space chains|
|Coupling from the past Open problems|
|Notes on notation Appendix B: Background material|
|Introduction to simulation|
|Solutions to selected exercises|