- Title
- Random walks : a review of algorithms and applications
- Creator
- Xia, Feng; Liu, Jiaying; Nie, Hansong; Fu, Yonghao; Wan, Liangtian; Kong, Xiangjie
- Date
- 2020
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/171929
- Identifier
- vital:14466
- Identifier
-
https://doi.org/10.1109/TETCI.2019.2952908
- Identifier
- ISBN:2471-285X (ISSN)
- Abstract
- 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. © 2017 IEEE.
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Relation
- IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 4, no. 2 (2020), p. 95-107
- Rights
- Copyright © 2019 IEEE.
- Rights
- This metadata is freely available under a CCO license
- Rights
- Open Access
- Subject
- 0805 Distributed Computing; 0806 Information Systems; 0906 Electrical and Electronic Engineering; Algorithm; Computational science; Quantum walks; Random walks
- Full Text
- Reviewed
- Hits: 4761
- Visitors: 5386
- Downloads: 805
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted | 1 MB | Adobe Acrobat PDF | View Details Download |