先探索低度节点加速网络探索
Exploring Low-degree Nodes First Accelerates Network Exploration
摘要：
我们考虑类Web网络上的信息扩散以及随机游走如何模拟它。在这个领域中研究得很好的问题是部分覆盖时间，即，随机游走器访问网络节点的给定部分所需的预期步数的计算。我们注意到，一些最快的解决方案实际上需要节点完全了解其邻居的度分布，这在许多实际情况下是无法获得的，例如，出于隐私原因。因此，我们引入一个版本的封面问题，考虑这样的限制：部分覆盖时间与预算。预算是对可以检查其程度的邻居数量的限制;我们已经从文献中调整了最优随机游走策略，以在这样的预算下运行。我们的解决方案被称为最小度（MD），本质上，它使随机游走者倾向于首先访问网络的外围区域。在六个真实数据集上进行的广泛基准测试证明，-也许是违反直觉的策略-MD策略实际上是非常有竞争力的。最先进的掩护算法
英文摘要：
We consider information diffusion on Web-like networks and how random walks can simulate it. A well-studied problem in this domain is Partial Cover Time, i.e., the calculation of the expected number of steps a random walker needs to visit a given fraction of the nodes of the network. We notice that some of the fastest solutions in fact require that nodes have perfect knowledge of the degree distribution of their neighbors, which in many practical cases is not obtainable, e.g., for privacy reasons. We thus introduce a version of the Cover problem that considers such limitations: Partial Cover Time with Budget. The budget is a limit on the number of neighbors that can be inspected for their degree; we have adapted optimal random walks strategies from the literature to operate under such budget. Our solution is called Min-degree (MD) and, essentially, it biases random walkers towards visiting peripheral areas of the network first. Extensive benchmarking on six real datasets proves that the---perhaps counter-intuitive strategy---MD strategy is in fact highly competitive wrt. state-of-the-art algorithms for cover.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
