The Stirling's formula and Polya's random walk theorem
Authors: 
Zhicheng Wan, Junyi Lin, Haozhou LiAuthors Info & Claims
Pages 56 - 59
Abstract
This paper is about Stirling's formula and its application in random walk, The article first introduces the Stirling's formula and random walks, as well as their applications, and then provides proofs for the Stirling's formula and some lemmas. We have proved the Polya's random walk theorem using Stirling's’s formula and obtained the conclusion that in one and two dimensions, the points of the random walk will always return to the starting point, but in three and higher dimensions, the points of the random walk may not necessarily return to the starting point.
References
[1]
Boyer, Carl B. A History of Mathematics. Wiley, 1959.
[2]
Pinsky, Mark A. 2007. “Stirling's Formula via the Poisson Distribution.” The American Mathematical Monthly 114 (3): 256–58.
[3]
Irkhin, Valentin Yu. “Relations between e and pi: Nilakantha's series and Stirling's formula.” (2022).
[4]
Durrett, R. (2010). *Probability: Theory and Examples*. Cambridge University Press.
[5]
Jakub Smolík. An Elementary Proof of Stirling's Formula. arXiv e-prints, page arXiv: 2310.04872, October 2023.
[6]
Montroll, E. W. "Random Walks in Multidimensional Spaces, Especially on Periodic Lattices." J. SIAM 4, 241-260, 1956.
[7]
Finch, S. R. "Pólya's Random Walk Constant." §5.9 in Mathematical Constants. Cambridge, England: Cambridge University Press, pp. 322-331, 2003.
[8]
Bernecker, T., Rehawi, G., Casale, F.P., Knauer-Arloth, J., & Marsico, A. (2024). Random Walk Diffusion for Efficient Large-Scale Graph Generation.
[9]
S. Bojja Venkatakrishnan, G. Fanti, and P. Viswanath, “Dandelion: Redesigning the bitcoin network for anonymity,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 1, no. 1, pp. 1–34, 2017
[10]
Nowak, W., Brunnette, T., Schalkers, M.A., & Moller, M. (2024). Overdispersion in gate tomography: Experiments and continuous, two-scale random walk model on the Bloch sphere
[11]
Pablo D. Carrasco, Túlio Vales. A symmetric Random Walk defined by the time-one map of a geodesic flow. Discrete and Continuous Dynamical Systems, 2021, 41(6): 2891-2905.
[12]
Samuel Herrmann, Nicolas Massin. Exit problem for Ornstein-Uhlenbeck processes: A random walk approach. Discrete and Continuous Dynamical Systems - B, 2020, 25(8): 3199-3215.
[13]
Corentin Le Coz, Christopher Battarbee, Ramón Flores, Thomas Koberda, Delaram Kahrobaei. Post-quantum hash functions using\({\rm{S}}{{\rm{L}}}_n( {{\mathbb{F}}_p} )\). Advances in Mathematics of Communications.
Index Terms
- The Stirling's formula and Polya's random walk theorem
Recommendations
On Stirling's formula remainder
Let the sequence r n be defined by n ! = 2 π n n / e n e r n . We establish new estimates for Stirling's formula remainder r n . This improves some known results. Let ( x ) be defined by the relation: ( x + 1 ) = 2 π ( x / e ) x e ( x ) / ( 12 x ) . We ...
Random Walk in an Alcove of an Affine Weyl Group, and Non-colliding Random Walks on an Interval
We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine Weyl groups. ...
Pólya's Theorem with zeros
Let R[X] be the real polynomial ring in n variables. Polya's Theorem says that if a homogeneous polynomial p@?R[X] is positive on the standard n-simplex @D"n, then for sufficiently large N all the coefficients of (X"1+...+X"n)^Np are positive. We give a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2024
119 pages
ISBN:9798400707094
DOI:10.1145/3704217
Copyright © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 January 2025
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
ESET 2024
ESET '24: 2024 8th International Conference on E-Society, E-Education and E-Technology
October 18 - 20, 2024
Batangas, Taipei, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 11Total Downloads
- Downloads (Last 12 months)11
- Downloads (Last 6 weeks)8
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in