arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.19720math.OCcs.MA
收藏

强连通图上线性一致性算法性能界限分析:利用有效电阻与可逆化

Performance bound analysis of linear consensus algorithm on strongly connected graphs using effective resistance and reversiblization

The University of Tokyo(东京大学)

Takumi Yonaiyama, Kazuhiro Sato

AI总结:

本文提出了一种基于有效电阻和可逆化的新方法,用于分析强连通图上线性一致性算法的LQ成本界限,扩展了非可逆情况下的性能分析。

摘要:

我们研究了在强连通有向图上线性一致性算法的性能,使用线性二次(LQ)成本作为性能度量。特别是,我们通过利用有效电阻和可逆化来推导LQ成本的界限。我们的结果扩展了以前的分析——这些分析仅限于可逆情况——到非可逆设置。为了实现这种泛化,我们引入了新的概念,称为往返路径和枢纽节点,它们作为传统技术的有效替代品,这些传统技术需要可逆性。此外,我们应用我们的方法到Cayley图和随机几何图上,以估计LQ成本而不假设可逆性。所提出的方法提供了一个框架,可以适应其他通常假设可逆性的场合。

英文摘要:

We study the performance of the linear consensus algorithm on strongly connected directed graphs using the linear quadratic (LQ) cost as a performance measure. In particular, we derive bounds on the LQ cost by leveraging effective resistance and reversiblization. Our results extend previous analyses-which were limited to reversible cases-to the nonreversible setting. To facilitate this generalization, we introduce novel concepts, termed the back-and-forth path and the pivot node, which serve as effective alternatives to traditional techniques that require reversibility. Moreover, we apply our approach to Cayley graphs and random geometric graphs to estimate the LQ cost without the reversibility assumption. The proposed approach provides a framework that can be adapted to other contexts where reversibility is typically assumed.

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

↑