Almost Sure Recurrence of the Simple Random Walk Path

Itai Benjamini; Ori Gurel-Gurevich

REVIEW

Almost Sure Recurrence of the Simple Random Walk Path

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 math/0508270 v2 pith:TJOJHKZJ submitted 2005-08-15 math.PR math.MG

Itai Benjamini , Ori Gurel-Gurevich This is my paper · ORCID

classification math.PRmath.MG

keywords walkalmostpathrandomsimpleconsistingcrossededges

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.

Discussion (0). Continue with ORCID to comment.

Pith tools