From shuffling cards to walking around the building: An introduction to modern Markov chain theory

zbMATH Open0902.60052MaRDI QIDQ1129844FDOQ1129844

Authors: Persi Diaconis 

Publication date: 24 August 1998

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/232971

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Convergence Rates for Markov Chains
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• The mathematics of mixing things up

zbMATH Keywords

rates of convergencesimulation procedures

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05)

Cited In (21)

• Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs
• Random walks on rings and modules
• The mathematics of mixing things up
• Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
• Algebraic structures underlying quantum independences: theory and applications
• Upper Bounds on Mixing Time of Finite Markov Chains
• Combinatiorial Markov chains
• Preface
• A Local Limit Theorem for Random Walks on the Chambers of Ã2 Buildings
• On the distribution of the search cost for the move-to-front rule with random weights
• A real-world Markov chain arising in recreational volleyball
• My journey into noncommutative lattices and their theory
• Character theory of monoids over an arbitrary field.
• Combinatorial topology and the global dimension of algebras arising in combinatorics
• Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
• Directed nonabelian sandpile models on trees
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• Mixing time for Markov chain on linear extensions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

This page was built for publication: From shuffling cards to walking around the building: An introduction to modern Markov chain theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129844)