Abstract
Suppose that n persons each know a different piece of information, and that, whenever a pair of them talk on the telephone, each tells the other all the information he knows at that time. If the calls are made at random, we show that the expected number of calls required for everyone to know all n pieces of information is asymptotically 1.5 n log n + O(n). This sharpens an earlier result of D. W. Boyd and J. M. Steele. Some numerical comparisons are given.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference2 articles.
1. Random exchanges of information;Moon;Nieuw. Arch. Wisk.,1972
2. Random exchanges of information
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sharp Thresholds in Random Simple Temporal Graphs;SIAM Journal on Computing;2024-03-19
2. Everyone Knows That Everyone Knows: Gossip Protocols for Super Experts;Studia Logica;2023-01-30
3. Sharp Thresholds in Random Simple Temporal Graphs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Time-Optimal Self-Stabilizing Leader Election in Population Protocols;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21
5. Dynamic Gossip;Bulletin of the Iranian Mathematical Society;2018-09-06