arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.09086cs.SIcs.DSmath.OC
收藏

基于边中心性的加权网络最优干预

Optimal Intervention on Weighted Networks via Edge Centrality

Dongyue Li, Tina Eliassi-Rad, Hongyang R. Zhang

摘要:

假设有一个传播过程,如传染病在图上传播。我们如何在传播过程中减少受影响的节点数量?这个问题出现在最近关于在移动网络上实施移动干预的研究中(Chang等人(2021))。减少未加权图上的感染的实用算法是移除具有最高边缘中心性得分的边缘(Tong等人(2012)),该边缘中心性得分是两个相邻节点的特征得分的乘积。然而,移动性网络具有加权边缘;因此,除了边缘移除之外,干预措施还将涉及边缘权重降低。受这个例子的启发,我们重新审视了通过将边权重降低到固定预算来最小化加权图上的顶部特征值的问题。我们观察到Tong et al.(2012)的边中心性得分等于$WW^{\top}$的最大特征值的梯度,其中$W$表示图的权重矩阵。然后,我们提出广义边缘中心分数的梯度的总和最大的$r$特征值的$WW^{\top}$。有了这个推广,我们设计了一个迭代算法,找到最佳的边重量减少收缩的最大$r$特征值的$WW^{\top}$在给定的边重量减少预算。我们还扩展了我们的算法和它的保证随时间变化的图形,其权重随着时间的推移而演变。我们进行了详细的实证研究,以验证我们的方法。我们的算法显着减少了感染的数量相比,现有的方法在11个加权网络。此外,我们说明了我们的算法的几个属性,包括选择秩$r$的好处,快速收敛到全局最优,和几乎线性运行时间每次迭代。

英文摘要:

Suppose there is a spreading process such as an infectious disease propagating on a graph. How would we reduce the number of affected nodes in the spreading process? This question appears in recent studies about implementing mobility interventions on mobility networks (Chang et al. (2021)). A practical algorithm to reduce infections on unweighted graphs is to remove edges with the highest edge centrality score (Tong et al. (2012)), which is the product of two adjacent nodes' eigenscores. However, mobility networks have weighted edges; Thus, an intervention measure would involve edge-weight reduction besides edge removal. Motivated by this example, we revisit the problem of minimizing top eigenvalue(s) on weighted graphs by decreasing edge weights up to a fixed budget. We observe that the edge centrality score of Tong et al. (2012) is equal to the gradient of the largest eigenvalue of $WW^{\top}$, where $W$ denotes the weight matrix of the graph. We then present generalized edge centrality scores as the gradient of the sum of the largest $r$ eigenvalues of $WW^{\top}$. With this generalization, we design an iterative algorithm to find the optimal edge-weight reduction to shrink the largest $r$ eigenvalues of $WW^{\top}$ under a given edge-weight reduction budget. We also extend our algorithm and its guarantee to time-varying graphs, whose weights evolve over time. We perform a detailed empirical study to validate our approach. Our algorithm significantly reduces the number of infections compared with existing methods on eleven weighted networks. Further, we illustrate several properties of our algorithm, including the benefit of choosing the rank $r$, fast convergence to global optimum, and an almost linear runtime per iteration.

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

↑