Gossiping With Multiple Messages

DOI10.1109/TIT.2007.909171zbMath1323.94056arXivcs/0612118MaRDI QIDQ3548820

Bruce Hajek, Laurent Massoulié, Sujay Sanghavi

Publication date: 21 December 2008

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

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Information theory (general) (94A15) Communication theory (94A05)

Related Items (6)

Stochastic analysis of rumor spreading with multiple pull operations ⋮ Continuous-time stochastic analysis of rumor spreading with multiple operations ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Almost sure exponential convergence to consensus of random gossip algorithms ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

This page was built for publication: Gossiping With Multiple Messages