Distributed computation of exact average degree and network size in finite time under quantized communication

DOI10.1016/j.ejcon.2023.100848zbMath1527.93167arXiv2211.16415MaRDI QIDQ6092455

Themistoklis Charalambous, Apostolos I. Rikos, Christoforos N. Hadjicostis, Karl Henrik Johansson

Publication date: 23 November 2023

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.16415

zbMATH Keywords

Markov chainsfinite timeleader electiondistributed networkssize estimationquantized communicationaverge degree calculation

Mathematics Subject Classification ID

Distributed algorithms (68W15) Multi-agent systems (93A16) Networked control (93B70)

Cites Work

• Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
• Effects of average degree on cooperation in networked evolutionary game
• Fast Byzantine leader election in dynamic networks
• On performance evaluation of distributed system size estimation executed by average consensus weights
• Distributed algorithms for reaching consensus on general functions
• Quantized consensus
• How to distribute antidote to control epidemics
• Peer counting and sampling in overlay networks
• Simple and Efficient Leader Election
• On the Complexity of Universal Leader Election

This page was built for publication: Distributed computation of exact average degree and network size in finite time under quantized communication