Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading

DOI10.1137/1.9781611973730.29zbMath1371.68028arXiv1311.2839OpenAlexW2951850108MaRDI QIDQ5362983

Zeyu Guo, He Sun

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Randomized algorithms (68W20) Network protocols (68M12)

This page was built for publication: Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading