边一致性问题的图论优化
最优化与控制
2020-06-30 v1
摘要
我们考虑在由边 Laplacian 描述的此类一致性网络的最小表示下，优化加权、时间缩放一致性网络的 范数的网络结构。我们证明贪心算法可用于寻找最小 范数生成树，以及当边被加回生成树时如何选择边以优化 范数。在考虑图中所有边的测量模型的边一致性情形下，我们证明在图中的慢节点之间添加边会带来 范数最小的增量。
引用
@article{arxiv.2006.16201,
title = {Graph-theoretic optimization for edge consensus},
author = {Mathias Hudoba de Badyn and Dillon R. Foight and Daniel Calderone and Mehran Mesbahi and Roy S. Smith},
journal= {arXiv preprint arXiv:2006.16201},
year = {2020}
}
备注
8 pages, 3 figures. Accepted to the 24th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2020), which has been postponed to August 2021. This version is the extended paper, which includes the proofs that were submitted for review