大度数节点的快速检测
Quick Detection of Nodes with Large Degrees
摘要：
我们的目标是快速找到大型复杂网络中度最大的节点的前$k$列表。如果网络的邻接表是已知的（在复杂网络中并不常见），找到最大度的节点的确定性算法需要O（n）的平均复杂度，其中$n$是网络中的节点数。对于大型复杂网络来说，即使是这种适度的复杂性也可能非常高。我们建议使用基于随机游走的方法。我们从理论上和数值实验表明，对于大型网络的随机游走方法找到高质量的高概率和计算数量级的节省的节点列表。我们还提出了停止标准的随机游走方法，需要很少的知识，网络的结构。
英文摘要：
Our goal is to quickly find top $k$ lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex networks), a deterministic algorithm to find a node with the largest degree requires an average complexity of O(n), where $n$ is the number of nodes in the network. Even this modest complexity can be very high for large complex networks. We propose to use the random walk based method. We show theoretically and by numerical experiments that for large networks the random walk method finds good quality top lists of nodes with high probability and with computational savings of orders of magnitude. We also propose stopping criteria for the random walk method which requires very little knowledge about the structure of the network.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
