Reversal of Markov Chains and the Forget Time
From MaRDI portal
Recommendations
Cited in
(8)- The access time of random walks on trees with given partition
- The evolving Moran genealogy
- To reverse a Markov process
- Exact mixing times for random walks on trees
- Exit frequency matrices for finite Markov chains
- The best mixing time for random walks on trees
- A hitting time formula for the discrete Green's function
- Relaxation time of \(L\)-reversal chains and other chromosome shuffles
This page was built for publication: Reversal of Markov Chains and the Forget Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4212880)