Interplay of Markov Chain and Random Walk in Several Areas

Authors

  • Keshu Qian

DOI:

https://doi.org/10.61173/v6bdye83

Keywords:

Markov chain, Random walk, Markov Decision Processes

Abstract

The research paper discusses the significance of Markov chain and random walk as fundamental probabilistic models that describe transitions between states in various fields, including natural language processing, finance, and bioinformatics. It traces the historical development of random walk, beginning with Karl Pearson’s initial concept in 1905 and culminating in the emergence of quantum random walks in the 21st century, while highlighting their mathematical properties and applications. The paper categorizes states in Markov chain into recurrent and transient, providing criteria for their classification and demonstrating the recurrence of random walks in different dimensions. It explores diverse applications of random walk, such as knowledge representation learning, Markov Decision Processes in reinforcement learning, advancements in medical research through neuroimaging, and innovative strategies for waste recycling path planning. The conclusion emphasizes the ongoing evolution of random walk theories, particularly with advancements in quantum computing and big data, suggesting that their applications will continue to expand and become increasingly sophisticated in the future.

References

[1] Pearson K. The problem of the random walk. Nature,1905, 72(1865):294-294.

[2] Nie, Zaiqing, et al. Object-Level Ranking: Bringing Order to Web Objects. Proceedings of the 14th International Conference on World Wide Web, ACM Press, 2005.

[3] Shen J, Du Y,Wang W, et al. Lazy random walks for superpixel segmentation. IEEE Transactions onmage Processing, 2014, 23(4):1451-1462.

[4] Sarkar P, Mooreaw. Random walks in social netw orks and their applications: a survey. Social Network Data Analytics. Springer, Boston, 2011: 43-77.

[5] Magniez F, Nayaka, Roland J, et al. Search via quantum walk. SIAM Journal on Computing, 2011, 40(1):142-164.

[6] Li Meng, Sun Xiaoming. Research Progress on Quantum Walk Related Algorithms. Information and Communications Technology and Policy, 2022(07): 28-36.

[7] Ruan Xiaohui, Bai Shihao. One-dimensional random walk problems of two types. Bulletin of Mathematics(Wuhan), 2024(11): 29-30+57.

[8] Jiang Xiaoquan. Design of a Knowledge Representation Learning Model Based on Random Walks and Long Short-Term Memory Neural Networks. Journal of Liaodong University (Natural Science Edition), 2023, 30(04):292-297.

[9] Ephraim, Y. and N. Merhav. Hidden Markov Processes. IEEE Transactions on Information Theory, 2002, 48(6): 1518–69.

[10] Guo Ming. Research on Structural Brain Networks in Schizophrenia Patients Based on Random Walk Embedding. Tai Yuan: Taiyuan University of Technology, 2023, 23: 1-76.

[11] Zhao Hongxia, Liou Gaosen, Li Yu. Optimal Path Planning for Classifying Waste Recycling Based on Random Walks. Journal of Transportation Engineering and Information, 2018, 16(03):103-108.

Downloads

Published

2024-12-31