.png){kind=icon}
返回
Consensus Over Ergodic Stationary Graph Processes
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2009.2034054.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this technical note, we provide a necessary and sufficient condition for convergence of consensus algorithms when the underlying graphs of the network are generated by an ergodic and stationary random process. We prove that consensus algorithms converge almost surely, if and only if, the expected graph of the network contains a directed spanning tree. Our results contain the case of independent and identically distributed graph processes as a special case. We also compute the mean and variance of the random consensus value that the algorithm converges to and provide a necessary and sufficient condition for the distribution of the consensus value to be degenerate.
Keyword:
Consensus algorithm
ergodic stationary process
random graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
Synchronization and convergence of linear dynamics in random directed networks随机有向网络中线性动力学的同步和收敛性
PREAI
分享收藏
查看更多内容