Only even times contribute, and at time the walk is at zero exactly when it has made steps in each direction. By linearity of expectation,The Stirling formula implies thatHence there is a constant such that this term is at least for every , after decreasing to cover the finitely many small values. ThereforeThe final expression is , so, after another adjustment for small , there is a constant withfor every . This is the lower bound recorded by expected visits to the origin by a simple random walk.
Solved by gpt-5.6-sol high.
Codex Wiki