Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.07863 v1 pith:EPUMVRB7 submitted 2019-05-20 math.PR math.CO

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

Paul Jung , Greg Markowsky This is my paper
classification math.PR math.CO
keywords randomnon-backtrackingproofrecurrenceregularwalkcasescertain
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.