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

zbMath0902.60052MaRDI QIDQ1129844

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

zbMATH Keywords

rates of convergencesimulation procedures

Mathematics Subject Classification ID

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

Related Items (15)

Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry ⋮ 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 ⋮ Mixing time for Markov chain on linear extensions ⋮ Algebraic structures underlying quantum independences: theory and applications ⋮ Combinatorial topology and the global dimension of algebras arising in combinatorics ⋮ Random walks on rings and modules ⋮ Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs ⋮ Mixing times of the biased card shuffling and the asymmetric exclusion process ⋮ My journey into noncommutative lattices and their theory ⋮ A Local Limit Theorem for Random Walks on the Chambers of Ã2 Buildings ⋮ Directed nonabelian sandpile models on trees ⋮ Character theory of monoids over an arbitrary field. ⋮ Applications of symmetric functions to cycle and increasing subsequence structure after shuffles

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