The DOI matches its Crossref record; 85 of the 87 references it cites were found in a registry or an index.
Random Walks: A Review of Algorithms and Applications
Open accessAbstract
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Deepfake leverages the power of artificial intelligence (AI) (Liu etal. 2018; Xia etal. 2019) to manipulate or generate visual and audio content with a high potential to deceive (Kietzmann etal. 2020).”
From Deepfake video detection: challenges and opportunities (2024) · cites this paper as Xia et al. 2019
Citations
Cites
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
(1999) · Cited by 12,854
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,984
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Cited by 3,828
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
The link‐prediction problem for social networks
Liben‐Nowell, D., & Kleinberg, J. M. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20591 · Cited by 3,063
Research works printed but not linked: 2
- wang, 2019, Phys Rev Lett, 122
- 10.1007/978-1-4419-8462-3_3 · DOI
Cited by
Sorted by citations
Items 101–200 of 295
Discrete-time quantum walk dispersion control through long-range correlations
Buarque, A. R. C., Passos, F. S., Dias, W. S., & Raposo, E. P. (2023) · Physical review. E · doi:10.1103/physreve.107.064139 · Cited by 8
Meta-learning assisted robust control of universal quantum gates with uncertainties
Zhang, S., Miao, Z., Pan, Y., Tao, S., & Chen, Y. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01034-9 · Cited by 5
On the fractional weibull process
Deng, W., Song, W., Cattani, C., Chen, J., & Chen, X. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.790791 · Cited by 5
Attributed Graph Force Learning
Sun, K., Xia, F., Liu, J., Xu, B., Saikrishna, V., & Aggarwal, C. C. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3221100 · Cited by 5
Self-citationStructural and topological guided GCN for link prediction in temporal networks
Sserwadda, A., Özcan, A., & Yaslan, Y. (2023) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-023-04639-0 · Cited by 5
gSWORD: GPU-accelerated Sampling for Subgraph Counting
Ye, C., Li, Y., Sun, S., & Guo, W. (2024) · Proceedings of the ACM on Management of Data · doi:10.1145/3639288 · Cited by 5
MIRROR: Mining Implicit Relationships via Structure-Enhanced Graph Convolutional Networks
Liu, J., Xia, F., Ren, J. F., Xu, B., Pang, G., & Chi, L. (2022) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3564531 · Cited by 5
Self-citationCoined quantum walks on the line: Disorder, entanglement, and localization
Yao, L. H., & Wald, S. (2023) · Physical review. E · doi:10.1103/physreve.108.024139 · Cited by 7
Triparts: Scalable Streaming Graph Partitioning to Enhance Community Structure
Bhoot, R., Khare, T., Agarwal, M., Jaiswal, S. D., & Simmhan, Y. L. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3746405.3746423 · Cited by 4
Quantitative study of random walk parameters in node2vec model
Li, Y., & Yang, B. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad3eea · Cited by 4
Brewing Vodka: Distilling Pure Knowledge for Lightweight Threat Detection in Audit Logs
Wu, W.-Y., Qiao, W., Yan, W., Jiang, B., Liu, Y., Liu, B., Lu, Z., & Liu, J. (2025) · International World Wide Web Conference (WWW) · doi:10.1145/3696410.3714563 · Cited by 7
Self-citationOn cover times of Markov chains
Séricola, B. (2024) · Stochastic Models · doi:10.1080/15326349.2024.2319201 · Cited by 4
Self-Supervised Teaching and Learning of Representations on Graphs
Wan, L., Fu, Z., Sun, L., Wang, X., Xu, G., Yan, X., & Xia, F. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583441 · Cited by 4
Self-citationAttributed Network Embedding Using an Improved Weisfeiler-Lehman Schema and a Novel Deep Skip-Gram
Al-Furas, A., Alrahmawy, M. F., Alblwi, A., Eladrosy, W., & Elmougy, S. (2023) · IEEE Access · doi:10.1109/access.2023.3320059 · Cited by 4
Quantum encoding of dynamic directed graphs
Giustina, D. D., Londero, C., Piazza, C., Riccardi, B., & Romanello, R. (2023) · Journal of Logical and Algebraic Methods in Programming · doi:10.1016/j.jlamp.2023.100925 · Cited by 6
Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networks
Xu, J., Huang, R., Jiang, X., Cao, Y., Yang, C., Wang, C., & Yang, Y. (2023) · PubMed · doi:10.48550/arxiv.2311.01038 · Cited by 8
Identification of influential vertices in complex networks: A hitting time‐based approach
Kumar, P., Singh, A. K., & Sharma, A. (2024) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.8031 · Cited by 4
VIBRANT-WALK: An algorithm to detect plagiarism of figures in academic papers
Parmar, S., & Jain, B. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124251 · Cited by 4
Design of biased random walks on a graph with application to collaborative recommendation
Leleux, P., Courtain, S., Françoisse, K., & Saerens, M. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126752 · Cited by 4
Ma, F., Wang, P., Luo, X., & Zhu, R. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3206210 · Cited by 4
Liu, C., Pan, W., & Zhou, H. (2023) · Journal of risk and financial management · doi:10.3390/jrfm16060285 · Cited by 4
Multi-omics Sampling-based Graph Transformer for Synthetic Lethality Prediction
Zhao, X., Liu, H., Dai, Q., Peng, H. M., Bai, X., & Peng, H. (2023) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm58861.2023.10385953 · Cited by 4
SaaN 2L-GRL: Two-Level Graph Representation Learning Empowered With Subgraph-as-a-Node
Park, J.-H., Lim, B.-Y., Lee, K., & Kwon, H.-Y. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3421933 · Cited by 4
Beyond Boundaries: Capturing Social Segregation on Hypernetworks
Failla, A., Rossetti, G., & Cauteruccio, F. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-78541-2_3 · Cited by 3
Robustness of Random Walk on a Graph against Adversary Attacks
Kawamura, H., Shiina, S., Aung, H. N., & Ohsaki, H. (2024) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac61105.2024.00146 · Cited by 3
Non-Markovianity in discrete-time open quantum random walk on arbitrary graphs
Rani, M., Dutta, S., & Banerjee, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04616-2 · Cited by 4
Coşkun, K., & Tümer, B. (2022) · Pattern Recognition · doi:10.1016/j.patcog.2022.108702 · Cited by 3
Zhao, Z., Meng, J., & Li, Y. (2022) · International Conference on Inventive Computation Technologies (ICICT) · doi:10.1109/icict54344.2022.9850630 · Cited by 3
Virtual Fences: A Systematic Literature Review
Abdouna, M., Ahmat, D., & Bissyandé, T. F. (2023) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-34896-9_9 · Cited by 3
A simple coin for a 2d entangled walk
Zahed, A., & Sen, K. (2023) · SciPost Physics Core · doi:10.21468/scipostphyscore.6.3.048 · Cited by 3
Deng, F., Zhao, Y., Pei, J., Wang, S., & Yang, X. (2023) · Information Sciences · doi:10.1016/j.ins.2023.119616 · Cited by 3
SUMMER: Bias-aware Prediction of Graduate Employment Based on Educational Big Data
Xia, F., Guo, T., Bai, X., Shatte, A. B. R., Liu, Z., & Tang, J. (2021) · ACM/IMS Transactions on Data Science · doi:10.1145/3510361 · Cited by 3
Self-citationRandom Walk in the Complete Graph : Hitting and Cover Times
Castella, F., & Séricola, B. (2025) · Methodology And Computing In Applied Probability · doi:10.1007/s11009-025-10166-6 · Cited by 2
Birds of a Feather: Enhancing Multimodal Fake News Detection Via Multi-Element Retrieval
Chen, X., Huang, X., Gao, Q., Li, H., Yu, J., & Liu, G. (2025) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65448.2025.00270 · Cited by 2
Du, P., You, J., Li, Y., & Chen, J. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111869 · Cited by 2
A Novel Global Prototype-Based Node Embedding Technique
Alkayem, Z., Zewail, R., Shoukry, A., Kawahara, D., & Mohamed, S. A. E. (2022) · IEEE Access · doi:10.1109/access.2022.3225413 · Cited by 2
Application of Random Walks in Data Processing
Zhang, Y., & Zhang, H. (2023) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v31i.5152 · Cited by 2
A Novel Image Segmentation Algorithm based on Continuous-Time Quantum Walk using Superpixels
Shi, W., Xu, F.-X., Zhou, Y., & Yang, Y. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05527-1 · Cited by 4
EchoSense: a framework for analyzing the echo chambers phenomenon: a case study on Qatar events
Kavargyris, D. C., Georgiou, K., & Angelis, L. (2024) · Social Network Analysis and Mining · doi:10.1007/s13278-024-01275-0 · Cited by 2
Zhang, Q., Yang, Y., Zu, C., Zhang, J., Wu, X., Zhou, J., & Wang, Y. (2025) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2025.3526498 · Cited by 2
Scalable Graph Classification via Random Walk Fingerprints
Li, P., Wang, H., & Böhm, C. (2024) · Proceedings · doi:10.1109/icdm59182.2024.00030 · Cited by 2
Bingo: Radix-based Bias Factorization for Random Walk on Dynamic Graphs
Wang, P., Huan, C., Wang, Z., Tian, C., Ji, Y., & Liu, H. (2025) · European Conference on Computer Systems · doi:10.1145/3689031.3717456 · Cited by 3
Complete Coverage Path Planning Strategy for Reconfigurable Robot With Variable Footprint
Tang, Q. R., Yi, L., Wan, A. Y. S., Hayat, A. A., Le, A. V., & Elara, M. R. (2025) · IEEE Access · doi:10.1109/access.2025.3560152 · Cited by 2
CIAGELP: Clustering Inspired Augmented Graph Embedding based Link Prediction in dynamic networks
Singh, N., Kumar, M., Kumar, S., & Biswas, B. (2025) · Data & Knowledge Engineering · doi:10.1016/j.datak.2025.102464 · Cited by 2
Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors
Slimen, I. B., Gueddana, A., & Lakshminarayanan, V. (2021) · International Journal of Quantum Information · doi:10.1142/s0219749921500088 · Cited by 4
SmartColor: Automatic Web Color Scheme Generation Based on Deep Learning
Feng, Z., Hou, M., Liu, H., Liu, M., Kaur, A., Febrinanto, F. G., & Zhao, W. (2021) · International Conference on Information and Communication Systems (ICICS) · doi:10.1109/icics52457.2021.9464536 · Cited by 2
Directed Graph Encoding in Quantum Computing Supporting Edge-Failures
Giustina, D. D., Piazza, C., Riccardi, B., & Romanello, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09005-9_6 · Cited by 2
Generative Service Provisioning for IoT Devices Using Line Graph Structure
Kim, J., & Kim, J. (2023) · IEEE Access · doi:10.1109/access.2023.3244890 · Cited by 2
Song, D., Zhu, C., Tao, J., Shi, X., & Wang, X. (2023) · Remote Sensing · doi:10.3390/rs15123109 · Cited by 2
Layout-Aware Quantum Circuitry and Algorithmic Extensions to Grover's Algorithm
Al-Bayaty, A. (2025) · doi:10.15760/etd.3924 · Cited by 2
Leveraging recommendations using a multiplex graph database
Yuehgoh, F., Djebali, S., & Travers, N. (2024) · International Journal of Web Information Systems · doi:10.1108/ijwis-05-2024-0137 · Cited by 2
Gajić, N., & Wolthusen, S. D. B. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-84260-3_9 · Cited by 1
Advances in Random and Quantum Walks: Bridging Classical and Quantum Computational Paradigms
Soni, A., Rasool, A., & Singh, D. P. (2025) · Procedia Computer Science · doi:10.1016/j.procs.2025.04.528 · Cited by 1
Pocher, N. (2025) · Law, governance and technology series · doi:10.1007/978-3-031-94698-1_4 · Cited by 1
Network-driven identification of indisulam neo-substrates for targeted protein degradation
Jarnuczak, A. F., Yogev, O., Andres, A., Ashenden, S. K., Cheng, Y., Pachl, F., Zhang, A., Cuomo, M. E., & Jin, M. (2025) · Molecular Omics · doi:10.1039/d5mo00053j · Cited by 1
Modeling meta-reasoning processes using diffusion and quantum random walk models
Malaiya, R. K., & Golden, R. M. (2025) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2025.102952 · Cited by 1
Fernández, G., Terán, J. M. G., Iglesias-Pordomingo, Á., Peláez-Rodríguez, C., Lorenzana, A., & Magdaleno, Á. (2025) · Modelling—International Open Access Journal of Modelling in Engineering Science · doi:10.3390/modelling6040144 · Cited by 1
Tang, F., Zhu, Y., Zhang, Z., Man, F., Ying, X., Chen, H., & Gan, Z. (2025) · Communications in computer and information science · doi:10.1007/978-981-95-4091-4_22 · Cited by 1
Generalized degree-biased random walk on scale-free networks
Singh, K., V., N. R., Chandrasekar, V. K., & Senthilkumar, D. V. (2025) · Physical review. E · doi:10.1103/z1mx-3nfh · Cited by 1
Bidirectional multi-nodes quantum teleportation using discrete-time quantum walk
Ikken, N., Kumar, P., Slaoui, A., Kar, B., Laamara, R. A., Moghadam, M. Z., & El‐Latif, A. A. A. (2025) · Scientific Reports · doi:10.1038/s41598-025-28524-2 · Cited by 1
Synergistic graph structure enhancement and beta modulated propagation for debiased recommendation
Kong, F., & Guan, S. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.114954 · Cited by 1
Combining graphlets and random walks for capturing complex network topology
Windels, S. F. L., Malod‐Dognin, N., & Pržulj, N. (2026) · Scientific Reports · doi:10.1038/s41598-026-44410-x · Cited by 1
Al-Bayaty, A., Al-Shuwaili, A., Alzubaidi, A. H., & Perkowski, M. A. (2026) · International Conference on Computing and Emerging Sciences · doi:10.1145/3797491.3797543 · Cited by 1
Li, D., & Zhu, X. (2026) · ISA Transactions · doi:10.1016/j.isatra.2026.05.025 · Cited by 1
Zeng, J., & Cao, Z.-J. (2026) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2026.112917 · Cited by 1
Sang, B., Gao, H., Yang, L., Xu, W., Chen, H., Xia, S., Li, T., & Wang, G. (2026) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2026.3700270 · Cited by 1
TrajGen: Approaches to the Artificial Generation of Trajectory Datasets
Walther, P., Teuscher, B., Luo, X., & Werner, M. (2026) · IEEE International Conference on Mobile Data Management (MDM) · doi:10.1109/mdm71479.2026.00022 · Cited by 1
3D printing part orientation optimization: discrete approximation of support volume
Guachetá-Alba, J. C., Garzon, S. G., Nunez, D. A., Mauledoux, M., & Sánchez, O. F. A. (2022) · International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering · doi:10.11591/ijece.v12i6.pp5958-5966 · Cited by 1
Mean Hitting Time of Q-subdivision Complex Networks
Kumar, P., Singh, A. K., Sharma, A., & Cherifi, H. (2023) · Studies in computational intelligence · doi:10.1007/978-3-031-21131-7_28 · Cited by 1
An incremental random walk algorithm for sampling continuous fitness landscapes
Li, Y., Liang, J., Yue, C., Yu, K., & Guo, H. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.126549 · Cited by 1
Automatic Measuring of Complex Walk and Simplest 555 Chip Chaos
Cheng, J., Huang, H., & Li, W. (2023) · International Conference on Computing and Artificial Intelligence (ICCAI) · doi:10.1145/3594315.3594406 · Cited by 1
Design and Implementation of Cyber Space Threat Detection System Based on User Behavioral Logs
Wang, W., Li, H., & Nie, P. (2023) · International Conference on Electronic Information Engineering and Computer Communication (EIECC) · doi:10.1109/eiecc60864.2023.10456685 · Cited by 1
A Improved Consistent Hash Algorithm in Heterogeneous Edge Computing
Chai, R., Gao, S., & Hu, Z. (2023) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads60453.2023.00315 · Cited by 1
Jafari, B. M., Luo, X., & Jafari, A. (2023) · Congress in Computer Science, Computer Engineering, and Applied Computing (CSCE) · doi:10.1109/csce60160.2023.00251 · Cited by 1
High-dimensional graphs convolution for quantum walks photonic applications
Abramov, R., Fedichkin, L. E., Tsarev, D. V., & Alodjants, A. P. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04351-8 · Cited by 1
Masson, M., Roose, P., Sallaberry, C., Bessagnet, M.-N., Parc, A. L., & Agerri, R. (2024) · Social Network Analysis and Mining · doi:10.1007/s13278-024-01282-1 · Cited by 1
Node Embedding Accelerates Randoms Walk on a Graph
Aung, H. N., & Ohsaki, H. (2024) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac61105.2024.00079 · Cited by 1
Alleviating Cold Start in the EOSC Recommendations: Extended Page Rank Algorithm
Wolski, M., Klorek, A., & Kobusińska, A. (2024) · IEEE Access · doi:10.1109/access.2024.3450632 · Cited by 1
Impact of local navigation rules on biased random walks in multiplex Markov chains
Kumar, A., Ghosh, S., Pal, P., & Hens, C. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.130122 · Cited by 1
Finite-sized one-dimensional lazy random walks
Kumar, M., Manikandan, K., & Sankaranarayanan, R. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05759-y · Cited by 1
Xu, J., Wang, J., Zhou, Z., & Lu, T. (2025) · INFORMS journal on computing · doi:10.1287/ijoc.2023.0115 · Cited by 1
Universality and classification of elementary thermal operations
Hack, P., & Mendl, C. B. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/adf26e · Cited by 2
Distributed Multi-Robot Exploration Approach with Connectivity Maintenance
Chaabi, H., & Mitton, N. (2025) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss-iot65416.2025.00020 · Cited by 1
Quantum algorithm for testing graph completeness
Giordano, S., & Martin-Delgado, M. A. (2025) · Annals of Physics · doi:10.1016/j.aop.2025.170305
A Quantum Approach to Walk on Networks
Singh, A. K., & Sachan, B. (2021) · International Conference on Signal Processing, Computing and Control (ISPCC) · doi:10.1109/ispcc53510.2021.9609345 · Cited by 1
Classical and Quantum Random Walks to Identify Leaders in Criminal Networks
Ficara, A., Fiumara, G., Meo, P. D., & Catanese, S. (2023) · Studies in computational intelligence · doi:10.1007/978-3-031-21127-0_16 · Cited by 1
Time Series Analysis of Computer Network Traffic in a Dedicated Link AggregationPreprint
Millán, G., Lefranc, G., Osorio-Comparán, R., & Lomas-Barrié, V. (2021) · Preprints.org · doi:10.20944/preprints202105.0506.v1 · Cited by 1
Deep Learning for Network Biology
Lusito, E. (2024) · Wiley eBooks · doi:10.1002/9781119846567.ch5 · Cited by 2
Response to glassy disorder in coin on spread of quantum walker
Ghosh, P., Sen, K., & Sen, U. (2026) · Physics Letters A · doi:10.1016/j.physleta.2026.131623 · Cited by 1
Time Series Analysis of Computer Network Traffic in a Dedicated Link AggregationPreprint
Millán, G., Lefranc, G., Osorio-Comparán, R., & Lomas-Barrié, V. (2021) · doi:10.36227/techrxiv.14575941
Time Series Analysis of Computer Network Traffic in a Dedicated Link AggregationPreprint
Millán, G., Lefranc, G., Osorio-Comparán, R., & Lomas-Barrié, V. (2021) · doi:10.36227/techrxiv.14575941.v1
Quantum Walk Circuits to Analyze Networks
Singh, A. K., & Sachan, B. (2022) · International Conference on Advanced Computing and Communication Systems (ICACCS) · doi:10.1109/icaccs54159.2022.9785059
Wang, Y. J., Zhang, X., Lam, C. K., Guo, H., Wang, C., Zhang, S., Wu, J. C., Snyder, M. P., & Li, J. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.06.23.496464
Wang, Z., & Yuan, Y. (2022) · Highlights in Science Engineering and Technology · doi:10.54097/hset.v6i.932
Studies on the generalized elephant quantum walk
Naves, C. B. (2022) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.76.2022.tde-31102022-163307
Scaling in the dynamics of directed lackadaisical quantum walks
Naredi, P., Kannan, J. B., & Santhanam, M. S. (2025) · Physics Letters A · doi:10.48550/arxiv.2211.06167
The role of network topological structure and semantic features in creating verbal aggression
Nejad, M. A., Nejad, S. A., Memariani, A., Asadpour, M., Hatami, J., & Kashani, M. M. (2022) · Journal of Complex Networks · doi:10.1093/comnet/cnac056
On the mean first passage time and mean cover time of a non-backtracking random walk on graphs
Matsuo, R., Kawagishi, T., & Ohsaki, H. (2022) · IEICE Communications Express · doi:10.1587/comex.2022xbl0146
On improving the properties of random walk on graph using Q-learning
Matsuo, R., Miyashita, T., Suzuki, T., & Ohsaki, H. (2022) · IEICE Communications Express · doi:10.1587/comex.2022xbl0153
Random Walks on Quasi-One-Dimensional Lattices
Sasom, S., & Hengpunya, V. (2023) · Journal of Statistical Physics · doi:10.1007/s10955-023-03113-7
Metadata
- Authors
- Xia, F., Liu, J., Nie, H., Fu, Y., Wan, L., & Kong, X.
- Affiliations
- Federation University (AU)
- Dalian University of Technology (CN)
- Venue
- IEEE Transactions on Emerging Topics in Computational Intelligence
- Published
- 2020-04
- Volume
- 4
- Issue
- 2
- Pages
- 95-107
- ISSN
- 2471-285X (ISSN-L)
- OpenAlex
- W2990908872
- Cited by
- 295
- References
- 87
- Citations by year
- 2026: 48 · 2025: 64 · 2024: 52 · 2023: 54 · 2022: 44 · 2021: 25 · 2020: 8
- FWCI
- 8.88
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Emerging Topics in Computational Intelligence (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- FedUni ResearchOnline (Federation University Australia) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Natural Science Foundation of China (61872054)
- Fundamental Research Funds for the Central Universities (DUT19LAB23, DUT18JC09)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Keywords
- random walks, quantum walks, classical random walks, network topology inference, node proximity, link prediction, graph embedding, semi-supervised learning, recommendations, time complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review