Abstract
For simple random walk on the integers, consider the chance that the walk has traveled distance k from its start given that its first return is at time 2n. We derive a limiting approximation accurate to order 1/n. We give a combinatorial explanation for a functional equation satisfied by the limit and show this yields the functional equation of Riemann's zeta function.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
