pith. sign in

arxiv: 1803.00811 · v1 · pith:WK4VIF33new · submitted 2018-03-02 · 🧮 math.CO

An easy proof of Polya's theorem on random walks

Yury Kochetkov This is my paper
classification 🧮 math.CO
keywords randomeasypolyaprooftheoremwalkslatticepoint
0
0 comments X
read the original abstract

We present an easy proof of Polya's theorem on random walks: with the probability one a random walk on the two-dimensional lattice returns to the starting point.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Extending the symbolic method in enumerative combinatorics. I

    math.CO 2025-11 unverdicted novelty 5.0

    Extends the symbolic method to infinite series and applies it to generalize Pólya's theorem on random walk visit probabilities to the weighted complete graph K_N.