Degree fluctuations and the convergence time of consensus algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the degree of any given node is constant in time, we show that the algorithm achieves consensus within a given accuracy ∈ on n n...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | Artigo |
| Idioma: | en_US |
| Publicado em: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Acesso em linha: | http://hdl.handle.net/1721.1/73573 https://orcid.org/0000-0003-2658-8239 |