arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.4760math.OCcs.SIphysics.soc-ph
收藏

什么是好计划?控制网络扩散过程的一种有效规划方法

What Makes a Good Plan? An Efficient Planning Approach to Control Diffusion Processes in Networks

Kevin Scaman, Argyris Kalogeratos, Nicolas Vayatis

摘要:

在本文中,我们分析了一个大类的简单的动态资源分配(分配)策略,我们命名为优先级规划的质量。它们的目的是控制不希望的扩散过程,根据预定义的优先级顺序分配资源的网络的传染性节点。在我们的分析中,我们把网络的拓扑问题归结为网络节点的线性排列。在这个角度下,我们阐明了这种安排的一个基本特征,最大切割宽度,用于评估任何优先规划策略的质量的作用。我们的理论分析验证了最大割宽的作用,推导出的扩散过程的消亡时的界限。最后,利用我们的分析结果,我们提出了一种新的和有效的并行计算策略,称为最大割宽最小化,在我们的模拟优于其他竞争策略。

英文摘要:

In this paper, we analyze the quality of a large class of simple dynamic resource allocation (DRA) strategies which we name priority planning. Their aim is to control an undesired diffusion process by distributing resources to the contagious nodes of the network according to a predefined priority-order. In our analysis, we reduce the DRA problem to the linear arrangement of the nodes of the network. Under this perspective, we shed light on the role of a fundamental characteristic of this arrangement, the maximum cutwidth, for assessing the quality of any priority planning strategy. Our theoretical analysis validates the role of the maximum cutwidth by deriving bounds for the extinction time of the diffusion process. Finally, using the results of our analysis, we propose a novel and efficient DRA strategy, called Maximum Cutwidth Minimization, that outperforms other competing strategies in our simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑