Abstract
We derive explicit formulas for the expected cover time and cover time distribution for Markov-generated binary patterns of length two, including the special case of sequences of independent observations. We include links to output and coding for Mathematica and R simulations and calculations as appropriate.
Citation
Evan Fisher. Tianman Huang. Xiaoshi Wang. "Cover times for Markov-generated binary sequences of length two." Rocky Mountain J. Math. 50 (3) 957 - 974, June 2020. https://doi.org/10.1216/rmj.2020.50.957
Information