Consensus Over Random Graph Processes: Network Borel–Cantelli Lemmas for Almost Sure Convergence

DOI10.1109/TIT.2015.2468584zbMath1359.94283arXiv1112.1336OpenAlexW3104269091WikidataQ124805316 ScholiaQ124805316MaRDI QIDQ2977249

Karl Henrik Johansson, Brian D. O. Anderson, Guo-Dong Shi

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Linear codes (general theory) (94B05) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items

Dynamics of opinions with social biases ⋮ Interval consensus over random networks ⋮ Dynamics over Signed Networks

This page was built for publication: Consensus Over Random Graph Processes: Network Borel–Cantelli Lemmas for Almost Sure Convergence