COVER TIMES FOR MARKOV-GENERATED BINARY SEQUENCES OF LENGTH TWO

被引：0

作者：

Fisher, Evan ^{[1
]}

Huang, Tianman ^{[2
]}

Wang, Xiaoshi ^{[3
]}

机构：

[1] Lafayette Coll, Dept Math, Easton, PA 18042 USA

[2] Carnegie Mellon Univ, Dept Stat, Pittsburgh, PA 15213 USA

[3] NYU, Dept Comp Sci, New York, NY USA

来源：

ROCKY MOUNTAIN JOURNAL OF MATHEMATICS | 2020年 / 50卷 / 03期

关键词：

Markov chains; cover times; binary patterns;

D O I：

10.1216/rmj.2020.50.957

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：957 / 974

页数：18

共 50 条

[1] SIMULTANEOUS VS SEQUENTIAL DISCRIMINATIONS OF MARKOV-GENERATED STIMULI
BROWN, BR
REBBIN, TJ
[J]. PERCEPTION & PSYCHOPHYSICS, 1970, 8 (5B): : 353 - &
[2] Cover times for sequences of reversible Markov chains on random graphs
Abe, Yoshihiro
[J]. KYOTO JOURNAL OF MATHEMATICS, 2014, 54 (03) : 555 - 576
[3] On cover times of Markov chains
Sericola, Bruno
[J]. STOCHASTIC MODELS, 2024,
[4] RECORDS GENERATED BY MARKOV SEQUENCES
ADKE, SR
[J]. STATISTICS & PROBABILITY LETTERS, 1993, 18 (04) : 257 - 263
[5] Markov Binary Sequences Generated by Post-Processing Based on Feedback Shift Registers
Maeda, Naruaki
Tsuneda, Akio
[J]. 2019 10TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE (ICTC): ICT CONVERGENCE LEADING THE AUTONOMOUS FUTURE, 2019, : 147 - 149
[6] Entropy-Variance Curves of Binary Sequences Generated by Random Substitutions of Constant Length
Carlos Nuno, Juan
Munoz, Francisco J.
[J]. ENTROPY, 2022, 24 (02)
[7] ALGORITHM FOR ESTIMATING A MARKOV-GENERATED INCREMENT-DECREMENT LIFE TABLE APPLICATIONS TO MARITAL-STATUS
SCHOEN, R
LAND, KC
[J]. POPULATION INDEX, 1978, 44 (03) : 447 - 447
[8] Optimum binary spreading sequences of Markov chains
Fujisaki, H
[J]. ELECTRONICS LETTERS, 2001, 37 (20) : 1234 - 1235
[9] A MARKOV MODEL FOR GENERATION OF RANDOM BINARY SEQUENCES
BUDESCU, DV
[J]. JOURNAL OF EXPERIMENTAL PSYCHOLOGY-HUMAN PERCEPTION AND PERFORMANCE, 1987, 13 (01) : 25 - 39
[10] A sharp estimate for cover times on binary trees
Ding, Jian
Zeitouni, Ofer
[J]. STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2012, 122 (05) : 2117 - 2133

← 1 2 3 4 5 →