arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.1569math.OCcs.SYeess.SY
收藏

联合中心性区分噪声网络中的最优领导者

Joint Centrality Distinguishes Optimal Leaders in Noisy Networks

Princeton University(普林斯顿大学)

Katherine E. Fitch, Naomi Ehrich Leonard

AI总结:

研究在噪声环境中,通过联合中心性选择最优领导者以最小化系统误差,提出新的中心性度量方法,证明单一领导者最优条件及多领导者平衡信息中心性与覆盖度。

摘要:

我们研究了在随机扰动下,一群智能体追踪外部未知信号的性能问题,其中只有有限的领导者能直接测量信号。我们探讨了在给定最大领导者数的情况下,最优领导者选择问题,其中最优领导者集合最小化定义为外部信号稳态方差的总系统误差。与之前已建立的贪心算法不同,我们的结果依赖于网络图属性的总系统误差表达式。我们证明了任何给定领导者集合的性能取决于其影响力,由新的图中心性度量确定。我们定义网络图中节点集合的联合中心性,使得具有最大联合中心性的领导者集合是最佳领导者集合。在单一领导者情况下,我们证明最优领导者是信息中心性最大的节点。在多个领导者情况下,我们显示最优领导者集合平衡高信息中心性与图的覆盖度。对于特殊图情况,我们显式求解最优领导者集合。我们通过示例进行说明。

英文摘要:

We study the performance of a network of agents tasked with tracking an external unknown signal in the presence of stochastic disturbances and under the condition that only a limited subset of agents, known as leaders, can measure the signal directly. We investigate the optimal leader selection problem for a prescribed maximum number of leaders, where the optimal leader set minimizes total system error defined as steady-state variance about the external signal. In contrast to previously established greedy algorithms for optimal leader selection, our results rely on an expression of total system error in terms of properties of the underlying network graph. We demonstrate that the performance of any given set of leaders depends on their influence as determined by a new graph measure of centrality of a set. We define the $joint \; centrality$ of a set of nodes in a network graph such that a leader set with maximal joint centrality is an optimal leader set. In the case of a single leader, we prove that the optimal leader is the node with maximal information centrality. In the case of multiple leaders, we show that the nodes in the optimal leader set balance high information centrality with a coverage of the graph. For special cases of graphs, we solve explicitly for optimal leader sets. We illustrate with examples.

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

↑