Resistance-based performance analysis of the consensus algorithm over geometric graphs

DOI10.1137/110857428MaRDI QIDQ2873861zbMATH OpenOpenAlexFDO

Authors Enrico Lovisari, Federica Garin, Sandro Zampieri

Publication date 27 January 2014

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/85f05e82206f3b1183bff702824717bb9be3008a

zbMATH Keywords

consensus algorithmdistributed averaginglarge-scale graphsmultiagent systems

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Mean square performance of consensus-based distributed estimation over regular geometric graphs
• Average consensus on networks with quantized communication
• Effect of network geometry and interference on consensus in wireless networks
• Convergence speed in distributed consensus and averaging
• Convergence speed in distributed consensus and averaging

Cited in

(5)

• Performance and design of cycles in consensus networks
• Mean square performance of consensus-based distributed estimation over regular geometric graphs
• Average resistance of toroidal graphs
• Maximizing convergence time in network averaging dynamics subject to edge removal
• Performance bound analysis of linear consensus algorithm on strongly connected graphs using effective resistance and reversiblization

This page was built for publication: Resistance-based performance analysis of the consensus algorithm over geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873861)