An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs

DOI10.1109/TAC.2014.2342071zbMath1360.93056arXiv1409.6828OpenAlexW2068834446MaRDI QIDQ2982792

Sanjeev R. Kulkarni, P. Cuff, Pan Hui, Shang Shang

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Decentralized systems (93A14) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Probabilistic consensus via polling and majority rules ⋮ Global majority consensus by local majority polling on graphs of a given degree sequence

This page was built for publication: An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs