Cover times for Markov-generated binary sequences of length two

Evan Fisher; Tianman Huang; Xiaoshi Wang

doi:10.1216/rmj.2020.50.957

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

Download 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

Received: 18 August 2019; Accepted: 20 November 2019; Published: June 2020

First available in Project Euclid: 29 July 2020

zbMATH: 07235590

MathSciNet: MR4132620

Digital Object Identifier: 10.1216/rmj.2020.50.957

Subjects:

Primary: 60C05 , 60J10

Keywords: binary patterns , Cover times , Markov chains

Abstract

Citation

Information

KEYWORDS/PHRASES

PUBLICATION TITLE:

PUBLICATION YEARS