期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 50, 期 11, 页码 1867-1872出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2005.858670
关键词
agreement problem; networked systems; random graphs; stochastic stability; supermartingales
We consider the agreement problem over random information networks. In a random network, the existence of an information channel between a pair of units at each time instance is probabilistic and independent of other channels; hence, the topology of the network varies over time. In such a framework, we address the asymptotic agreement for the networked units via notions from stochastic stability. Furthermore, we delineate on the rate of convergence as it relates to the algebraic connectivity of random graphs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据