Random walks on Z2n

P. Erdős, Robert W. Chen

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

For each positive integer n ≥ 1, let Z2n be the direct product of n copies of Z2, i.e., Z2n = {(a1, a2, ..., an)∥ai = 0 or 1 for all i = 1, 2, ..., n} and let {Wtn}t≥0 be a random walk on Z2n such that P{W0n = A} = 2-n for all A's in Z2n and P{Wj+1n = (a2, a3, ..., an, 0)∥Wjn = (a1, a2, ..., an)} = P{Wj+1n = (a2, a3, ..., an, 1)∥Wjn = (a1, a2, ..., an)} = 1 2 for all j = 0, 1, 2, ..., and all (a1, a2, ..., an)'s in Z2n. For each positive integer n ≥ 1, let Cn denote the covering time taken by the random walk Wtn on Z2n to cover Z2n, i.e., to visit every element of Z2n. In this paper, we prove that, among other results, P{except finitely many n, c2nln(2n) <Cn <d2nln(2n)} = 1 if c <1 <d.

Original languageEnglish
Pages (from-to)111-118
Number of pages8
JournalJournal of Multivariate Analysis
Volume25
Issue number1
DOIs
Publication statusPublished - 1988

Fingerprint

Random walk
Integer
Direct Product
Covering
Cover
Denote

Keywords

  • Borel-Cantelli lemma
  • covering time
  • random walks

ASJC Scopus subject areas

  • Statistics, Probability and Uncertainty
  • Numerical Analysis
  • Statistics and Probability

Cite this

Random walks on Z2n. / Erdős, P.; Chen, Robert W.

In: Journal of Multivariate Analysis, Vol. 25, No. 1, 1988, p. 111-118.

Research output: Contribution to journalArticle

Erdős, P. ; Chen, Robert W. / Random walks on Z2n. In: Journal of Multivariate Analysis. 1988 ; Vol. 25, No. 1. pp. 111-118.
@article{bba043f90d22475e982ad55297f531aa,
title = "Random walks on Z2n",
abstract = "For each positive integer n ≥ 1, let Z2n be the direct product of n copies of Z2, i.e., Z2n = {(a1, a2, ..., an)∥ai = 0 or 1 for all i = 1, 2, ..., n} and let {Wtn}t≥0 be a random walk on Z2n such that P{W0n = A} = 2-n for all A's in Z2n and P{Wj+1n = (a2, a3, ..., an, 0)∥Wjn = (a1, a2, ..., an)} = P{Wj+1n = (a2, a3, ..., an, 1)∥Wjn = (a1, a2, ..., an)} = 1 2 for all j = 0, 1, 2, ..., and all (a1, a2, ..., an)'s in Z2n. For each positive integer n ≥ 1, let Cn denote the covering time taken by the random walk Wtn on Z2n to cover Z2n, i.e., to visit every element of Z2n. In this paper, we prove that, among other results, P{except finitely many n, c2nln(2n) <Cn nln(2n)} = 1 if c <1",
keywords = "Borel-Cantelli lemma, covering time, random walks",
author = "P. Erdős and Chen, {Robert W.}",
year = "1988",
doi = "10.1016/0047-259X(88)90156-X",
language = "English",
volume = "25",
pages = "111--118",
journal = "Journal of Multivariate Analysis",
issn = "0047-259X",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Random walks on Z2n

AU - Erdős, P.

AU - Chen, Robert W.

PY - 1988

Y1 - 1988

N2 - For each positive integer n ≥ 1, let Z2n be the direct product of n copies of Z2, i.e., Z2n = {(a1, a2, ..., an)∥ai = 0 or 1 for all i = 1, 2, ..., n} and let {Wtn}t≥0 be a random walk on Z2n such that P{W0n = A} = 2-n for all A's in Z2n and P{Wj+1n = (a2, a3, ..., an, 0)∥Wjn = (a1, a2, ..., an)} = P{Wj+1n = (a2, a3, ..., an, 1)∥Wjn = (a1, a2, ..., an)} = 1 2 for all j = 0, 1, 2, ..., and all (a1, a2, ..., an)'s in Z2n. For each positive integer n ≥ 1, let Cn denote the covering time taken by the random walk Wtn on Z2n to cover Z2n, i.e., to visit every element of Z2n. In this paper, we prove that, among other results, P{except finitely many n, c2nln(2n) <Cn nln(2n)} = 1 if c <1

AB - For each positive integer n ≥ 1, let Z2n be the direct product of n copies of Z2, i.e., Z2n = {(a1, a2, ..., an)∥ai = 0 or 1 for all i = 1, 2, ..., n} and let {Wtn}t≥0 be a random walk on Z2n such that P{W0n = A} = 2-n for all A's in Z2n and P{Wj+1n = (a2, a3, ..., an, 0)∥Wjn = (a1, a2, ..., an)} = P{Wj+1n = (a2, a3, ..., an, 1)∥Wjn = (a1, a2, ..., an)} = 1 2 for all j = 0, 1, 2, ..., and all (a1, a2, ..., an)'s in Z2n. For each positive integer n ≥ 1, let Cn denote the covering time taken by the random walk Wtn on Z2n to cover Z2n, i.e., to visit every element of Z2n. In this paper, we prove that, among other results, P{except finitely many n, c2nln(2n) <Cn nln(2n)} = 1 if c <1

KW - Borel-Cantelli lemma

KW - covering time

KW - random walks

UR - http://www.scopus.com/inward/record.url?scp=1542528305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1542528305&partnerID=8YFLogxK

U2 - 10.1016/0047-259X(88)90156-X

DO - 10.1016/0047-259X(88)90156-X

M3 - Article

VL - 25

SP - 111

EP - 118

JO - Journal of Multivariate Analysis

JF - Journal of Multivariate Analysis

SN - 0047-259X

IS - 1

ER -