A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
From MaRDI portal
Publication:6566378
Eigenvalues, singular values, and eigenvectors (15A18) Stochastic matrices (15B51) Probabilistic methods in group theory (20P05) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Stationary stochastic processes (60G10) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Recommendations
Cites work
- Analysis of Top To Random Shuffles
- Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in Dynkin types A, B and D
- Card shuffling and the decomposition of tensor products.
- Comparison theorems for reversible Markov chains
- Convergence Rates for Markov Chains
- Double coset Markov chains
- scientific article; zbMATH DE number 3514781 (Why is no real title available?)
- Involutive random walks on total orders and the anti-diagonal eigenvalue property
- Lumpings of algebraic Markov chains arise from subquotients
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On the matrix occurring in a linear search problem
- Random walks and hyperplane arrangements
- Statistical enumeration of groups by double cosets
- The bias of three pseudo-random shuffles
- The hit-and-run version of top-to-random
- Trailing the dovetail shuffle to its lair
This page was built for publication: A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566378)