Polya's random walk theorem

2013/01/16 by Jonathan Novak, Novak, Jonathan · 2 citations
Computer Science · Mathematics · #60-01 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #FOS: Mathematics #Mathematical Dynamics and Fractals #Probability (math.PR)

paper · pdf · doi:10.48550/arxiv.1301.3916

openalex publication_date 2013/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note presents a proof of Pólya's random walk theorem using classical methods from special function theory and asymptotic analysis.

Cited by

• Extending the symbolic method in enumerative combinatorics. I
• Directed lattice paths avoiding periodic subset of points on "time"-axis

Related

• An easy proof of Polya's theorem on random walks
• On Pólya's random walk constants
• A non-backtracking Polya's theorem
• A.S. convergence for infinite colour Pólya urns associated with stable random walks
• Complementary asymptotic analysis for a minimal random walk