Remarks on the recurrence and transience of non-backtracking random walks

Paul Jung; Greg Markowsky

doi:10.4310/JOC.2020.v11.n3.a7

Remarks on the recurrence and transience of non-backtracking random walks

Paul Jung, Greg Markowsky

School of Mathematics

Research output: Contribution to journal › Article › Research › peer-review

Abstract

A short proof of the equivalence of the recurrence of a non-backtracking random walk and that of a simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.

Original language	English
Pages (from-to)	549-555
Number of pages	7
Journal	Journal of Combinatorics
Volume	11
Issue number	3
DOIs	https://doi.org/10.4310/JOC.2020.v11.n3.a7
Publication status	Published - 2020

Keywords

Non-backtracking random walk
Pólya’s theorem

Access to Document

10.4310/JOC.2020.v11.n3.a7

Cite this

@article{2528b967107740088fcd0ff88505428e,

title = "Remarks on the recurrence and transience of non-backtracking random walks",

abstract = "A short proof of the equivalence of the recurrence of a non-backtracking random walk and that of a simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.",

keywords = "Non-backtracking random walk, P{\'o}lya{\textquoteright}s theorem",

author = "Paul Jung and Greg Markowsky",

year = "2020",

doi = "10.4310/JOC.2020.v11.n3.a7",

language = "English",

volume = "11",

pages = "549--555",

journal = "Journal of Combinatorics",

issn = "2156-3527",

publisher = "International Press of Boston, Inc.",

number = "3",

}

TY - JOUR

T1 - Remarks on the recurrence and transience of non-backtracking random walks

AU - Jung, Paul

AU - Markowsky, Greg

PY - 2020

Y1 - 2020

N2 - A short proof of the equivalence of the recurrence of a non-backtracking random walk and that of a simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.

AB - A short proof of the equivalence of the recurrence of a non-backtracking random walk and that of a simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.

KW - Non-backtracking random walk

KW - Pólya’s theorem

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

U2 - 10.4310/JOC.2020.v11.n3.a7

DO - 10.4310/JOC.2020.v11.n3.a7

M3 - Article

AN - SCOPUS:85207849114

SN - 2156-3527

VL - 11

SP - 549

EP - 555

JO - Journal of Combinatorics

JF - Journal of Combinatorics

IS - 3

ER -

Remarks on the recurrence and transience of non-backtracking random walks

Abstract

Keywords

Access to Document

Other files and links

Cite this