一致性模型中最优和近优目标集的结构
The Structure of Optimal and Near Optimal Target Sets in Consensus Models
摘要:
我们考虑的问题是在一个网络中确定一个子集的节点,这将使最快的信息传播在一个分散的environment.In一个基于无向图上的随机游走的通信模型,在所有集合的相同或更小的基数集的最佳集合最小化的平均首次到达时间的总和,由步行者开始在集合外的节点。这个问题起源于对网络中信息传播或共识的研究,并由V.Borkar等人在2010年以这种形式引入。更一般地说,A. Clark等人在2012年指出,估计所谓的领导者跟随者系统的最快收敛速度会导致考虑相同的优化问题。要最小化的集合函数$F$是超模的,因此贪心算法通常用于构造最优集合或其近似。在本文中,这个问题是重新制定,使搜索的解决方案仅限于最佳和接近最佳的子集的图。我们证明了存在的一个greedoid结构,包含可行的最佳和近最佳集的充分条件。因此,我们可以推测,以逐步的方式通过局部移动来搜索最优或接近最优的集合,以获得接近最优的集合,该接近最优的集合是比通过使用贪心算法保证的最优性的因子$(1-1/e)$程度更好的近似。一个简单的例子说明了该方法的各个方面。
英文摘要:
We consider the problem of identifying a subset of nodes in a network that will enable the fastest spread of information in a decentralized environment.In a model of communication based on a random walk on an undirected graph, the optimal set over all sets of the same or smaller cardinality minimizes the sum of the mean first arrival times to the set by walkers starting at nodes outside the set. The problem originates from the study of the spread of information or consensus in a network and was introduced in this form by V.Borkar et al. in 2010. More generally, the work of A. Clark et al. in 2012 showed that estimating the fastest rate of convergence to consensus of so-called leader follower systems leads to a consideration of the same optimization problem. The set function $F$ to be minimized is supermodular and therefore the greedy algorithm is commonly used to construct optimal sets or their approximations. In this paper, the problem is reformulated so that the search for solutions is restricted to optimal and near optimal subsets of the graph. We prove sufficient conditions for the existence of a greedoid structure that contains feasible optimal and near optimal sets. It is therefore possible we conjecture, to search for optimal or near optimal sets by local moves in a stepwise manner to obtain near optimal sets that are better approximations than the factor $(1-1/e)$ degree of optimality guaranteed by the use of the greedy algorithm. A simple example illustrates aspects of the method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。