A One-Parameter Family of Distributed Consensus Algorithms with Boundary: From Shortest Paths to Mean Hitting Times

Author(s):  
Alireza Tahbaz-Salehi ◽  
Ali Jadbabaie
2014 ◽  
Vol 511-512 ◽  
pp. 950-953
Author(s):  
Huan Xin Peng ◽  
Wen Kai Wang ◽  
Bin Liu

The convergence rate is very important in the distributed consensus problems, especially, for the distributed consensus algorithms based on large-scale complex networks. In order to accelerate the convergence rate of the distributed consensus algorithms, in the paper, we propose an optimized topology model by adding randomly a few shortcuts to the nearest neighbor coupling networks, and the shortcuts follow a normal distribution. By analyses and simulations, the results show that the algebraic connectivity of the new model is bigger than that of the NMW model, and the convergence rate of the distributed consensus based on the new model is higher than that based on the NMW model


2019 ◽  
Vol 5 (2) ◽  
pp. 93 ◽  
Author(s):  
StanislawP Stawicki ◽  
Mateusz Plaza ◽  
Lorenzo Paladino ◽  
IjeomaNnodim Opara ◽  
MichaelS Firstenberg ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document