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.
An easy proof of Polya's theorem on random walks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extending the symbolic method in enumerative combinatorics. I
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.