随机游动:算法与应用综述
Random Walks: A Review of Algorithms and Applications
摘要:
随机游走被称为随机过程,它描述了数学空间中包括一系列随机步骤的路径。它在数学和计算机科学等各个学科中越来越受欢迎。此外,在量子力学中,量子游动可以被视为经典随机游动的量子类似物。经典的随机游走和量子游走可以用来计算节点之间的邻近度,并提取网络中的拓扑结构。各种随机游走相关模型可以应用于不同的领域,这对链接预测、推荐、计算机视觉、半监督学习、网络嵌入等下游任务具有重要意义。在本文中,我们的目的是提供一个全面的审查经典的随机游动和量子游动。本文首先回顾了经典随机游动和量子游动的相关知识,包括基本概念和一些典型算法。我们还从时间复杂度的角度比较了基于量子游动和经典随机游动的算法。然后介绍了它们在计算机科学领域中的应用。最后,我们讨论了开放的问题,从效率的角度,内存容量,和现有的算法的计算时间。这项研究旨在通过探索随机行走和量子行走来为这一不断增长的研究领域做出贡献。
英文摘要:
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 paper, 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。