Random Walk in Graphs Analyzing and Applications
DOI:
https://doi.org/10.54097/wmvygc73Keywords:
Random Walk; Graph Analysis; Graph Comparison; Structural Change Detection; PageRank; Spectral Matching.Abstract
As a fundamental topic in probability theory, the random walk has a wide range of applications in real-world scenarios. It is widely employed not only in financial and economic fields such as stock price forecasting and video game design, but also in more abstract domains including graph analysis, especially network graph analysis. This study demonstrates that the random walk is effective in dealing with network graph–related problems. During the experience, MATLAB is used to test the ability of random walk in identifying the difference between two graphs, and it shows that random walk shows some advantage in identifying difference between network graphs compared to spectral matching, which has been viewed as authentic method relating to graphs for many years. What’s more, it also shows possibility that when combined with big data models, random walk can further show great potential in investigating the relationships among two or more network graphs.
Downloads
References
[1] J. Yang, 2024,"Analysis of the Application for Random Walk in Computer Science, Physics and Mathematical Equations." International Division of No.2 High School of East China Normal University, Shanghai, China.
[2] P. Haslum, 1999"Model Checking by Random Walk." Department of Computer Science, Linköping University.
[3] U. Kang, M. Hebert, and S. Park, “Fast and scalable approximate spectral graph matching for correspondence problems,” Information Sciences, vol. 220, pp. 306–318, Jan. 2013, doi: 10.1016/j.ins.2012.07.008.
[4] Jin, D., Wang, R., Ge, M., He, D., Li, X., Lin, W., & Zhang, W. (2022). RAW-GNN: RAndom Walk Aggregation based Graph Neural Network. In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI).
[5] Dhillon, M., & Kataria, K. K. (2025). On elephant random walk with random memory. arXiv. https://arxiv.org/abs/2501.12866
[6] Pearson K. The problem of the Random Walk. Nature News, Nature Publishing Group, 1905, 7: 1.
[7] Ng, P. S., & Suo, J. (2022). How can random walk be applied to analysis stock. Academic Journal of Mathematical Sciences, 3(2). https://doi.org/10.25236/ajms.2022.030205
[8] Cox, John C., Stephen A. Ross, and Mark Rubinstein. ”Option pricing: A simplified approach.” Journal of financial Economics 7.3 (1978): 229-263.
[9] Bera, S. K., & Seshadhri, C. (2020). How to count triangles, without seeing the whole graph. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (pp. 431–441). Association for Computing Machinery. https://doi.org/10.1145/3394486.3403073
[10] Leordeanu, M., & Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints. ICCV.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Highlights in Science, Engineering and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
