arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.01269eess.SYcs.SY
收藏

通过谱聚类和多项式滤波器加速共识

Accelerating Consensus by Spectral Clustering and Polynomial Filters

Ghent University(根特大学);INRIA Rocquencourt(法国国家信息与自动化研究所罗康库尔中心)

Simon Apers, Alain Sarlette

AI总结:

本文研究了二阶滤波器的增益,提出预处理方法以加速共识收敛,通过将特征值分组优化收敛速度,同时指出多项式滤波器可能的鲁棒性损失。

摘要:

已知多项式滤波可以加速无向网络上的平均共识收敛。本文研究了二阶滤波器的增益。确定了一组图,使得共识可在有限时间内达成,并提出预处理方法,以调整任意图的无向权重,以实现最快收敛。对应的成本函数不同于传统谱间隙,因为它倾向于将特征值分成两个集群。同时,也指出了多项式滤波器可能的鲁棒性损失。

英文摘要:

It is known that polynomial filtering can accelerate the convergence towards average consensus on an undirected network. In this paper the gain of a second-order filtering is investigated. A set of graphs is determined for which consensus can be attained in finite time, and a preconditioner is proposed to adapt the undirected weights of any given graph to achieve fastest convergence with the polynomial filter. The corresponding cost function differs from the traditional spectral gap, as it favors grouping the eigenvalues in two clusters. A possible loss of robustness of the polynomial filter is also highlighted.

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

↑