Beyond Polya’S Random Walk Theorem
DOI:
https://doi.org/10.54097/jw2bp960Keywords:
Random walk; recurrence; polya’s random walk theorem.Abstract
A random walk can be regarded as a probability model depicting some degree of randomness, which has lots of interdisciplinary applications in physics, biochemistry and computer science. In this paper, the recurrence classifications of five different random walk models are presented along with their relevant studies. In order to explore the essential reasons leading to the qualitative change of simple random walks’ recurrence property, the classification results of the five simple random walk variants are horizontally discussed. As a result, a positive bias is found to be the denominator shared by random walk variants whose recurrence classifications are different from that of simple random walks. A limited walking direction is also found useful in reversing the recurrence result. Besides answering the qualitative change question, this paper is also dedicated to provide a summary of the recurrence properties of different current random walk models, in order to help researchers in related fields to quickly get the picture of some random walk models.
Downloads
References
Carazza B. The history of the random-walk problem: considerations on the interdisciplinarity in modern physics. La Rivista del Nuovo Cimento (1971-1977), 1977, 7: 419-427.
Chen D, Zhang F. Recurrence and Collisions of Random Walks. Advances in Mathematics (China), 2014, 43(2): 175-182.
Pólya G. Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Straßennetz. Mathematische Annalen, 1921, 84(1-2): 149-160.
Xu H, Tang L. Proof of non-recurrence for d-dimensional(d≥3) symmetric random walks. Journal of Hefei University of Technology. Natural Science, 2009, 32(9): 1451-1453.
Novak J. Polya's random walk theorem. The American Mathematical Monthly, 2014, 121(8): 711-716.
Lange K. Polya's Random Walk Theorem Revisited. The American Mathematical Monthly, 2015, 122(10): 1005-1007
Abramov V M. Conservative and semiconservative random walks: recurrence and transience. Journal of Theoretical Probability, 2018, 31(3): 1900-1922.
Kempton M. A non-backtracking Polya's theorem. Journal of Combinatorics, 2018, 9(2): 327-343.
Michelitsch T M, Polito F, Riascos A P. Asymmetric random walks with bias generated by discrete-time counting processes. Communications in Nonlinear Science and Numerical Simulation, 2022, 109: 106121.
Min R E N, Jing C U I. Random Walks with Resting State in a Independent Random Environment on the Line. Journal of Systems Science and Mathematical Sciences, 2009, 29(5): 637.
Herdade S, Vu V. Random walks with different directions: Drunkards beware. arXiv preprint arXiv:1409.7991, 2014.
Alon N, Benjamini I, Lubetzky E, et al. Non-backtracking random walks mix faster. Communications in Contemporary Mathematics, 2007, 9(04): 585-603.
Fitzner R, van der Hofstad R. Non-backtracking random walk. Journal of Statistical Physics, 2013, 150: 264-284.
Jung P, Markowsky G. Remarks on the recurrence and transience of non-backtracking random walks. arXiv preprint arXiv:1905.07863, 2019.
Beck J. Recurrence of inhomogeneous random walks. Periodica mathematica Hungarica, 2017, 74: 137-196.
Aleja D, Criado R, del Amo A J G, et al. Non-backtracking PageRank: From the classic model to Hashimoto matrices. Chaos, Solitons & Fractals, 2019, 126: 283-291.
Arrigo F. Non-backtracking PageRank. Journal of Scientific Computing, 2019, 80(3): 1419-1437.
Jost J, Mulas R, Torres L. Spectral theory of the non-backtracking Laplacian for graphs. Discrete Mathematics, 2023, 346(10): 113536
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







