边缘去除下网络平均动力学的最大收敛时间
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal
摘要:
我们考虑的共识阻断问题(CIP),其中的目标是最大限度地提高收敛时间的共识平均动态删除有限数量的网络边缘。我们首先表明,CIP可以铸造作为一个有效的电阻阻断问题(ERIP),其中的目标是删除有限数量的网络边缘,以最大限度地提高有效电阻之间的源节点和汇节点。我们发现,ERIP是强NP-硬的,即使是固定的源/汇边缘的直径为3的二部图,并建立相同的硬度结果的CIP。然后,我们表明,ERIP和CIP不能近似到一个(近)多项式因子假设指数时间假设。随后,我们设计了一个多项式时间的$mn$近似算法的ERIP,只依赖于节点的数量$n$和边缘的数量$m$,但不依赖于边缘电阻的大小。最后,使用二次规划制定CIP,我们设计了一个迭代近似算法,找到一个一阶固定的CIP解决方案,并通过数值结果评估其良好的性能。
英文摘要:
We consider the consensus interdiction problem (CIP), in which the goal is to maximize the convergence time of consensus averaging dynamics subject to removing a limited number of network edges. We first show that CIP can be cast as an effective resistance interdiction problem (ERIP), in which the goal is to remove a limited number of network edges to maximize the effective resistance between a source node and a sink node. We show that ERIP is strongly NP-hard, even for bipartite graphs of diameter three with fixed source/sink edges, and establish the same hardness result for the CIP. We then show that both ERIP and CIP cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis. Subsequently, we devise a polynomial-time $mn$-approximation algorithm for the ERIP that only depends on the number of nodes $n$ and the number of edges $m$, but is independent of the size of edge resistances. Finally, using a quadratic program formulation for the CIP, we devise an iterative approximation algorithm to find a first-order stationary solution for the CIP and evaluate its good performance through numerical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。