How to Design a Linear Cover Time Random Walk on a Finite Graph
From MaRDI portal
Recommendations
Cites work
- A tight lower bound on the cover time for random walks on graphs
- A tight upper bound on the cover time for random walks on graphs
- Covering problems for Markov chains
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 2038774 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- Maximum hitting time for random walks on graphs
- Monte Carlo sampling methods using Markov chains and their applications
- On the time taken by random walks on finite groups to visit every state
- The hitting and cover times of Metropolis walks
- The hitting and cover times of random walks on finite graphs using local degree information
Cited in
(3)
This page was built for publication: How to Design a Linear Cover Time Random Walk on a Finite Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3646121)