journalarticle
Testing Symmetric Markov Chains Without Hitting
Annual Conference Computational Learning Theory2019 15 citations42 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRAn algorithm is proposed that avoids this dependence on hitting time thus enabling efficient testing of markov chains even in cases where it is infeasible to observe every state in the chain, based on combining classical ideas from approximation algorithms with techniques for the spectral analysis of Markov chains. (Semantic Scholar)