.png){kind=icon}
.png){kind=icon}
Return
Consensus Over Ergodic Stationary Graph Processes
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2009.2034054.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Consensus algorithm
ergodic stationary process
random graph
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W