Random exchanges of information
-
Published:1979-09
Issue:03
Volume:16
Page:657-661
-
ISSN:0021-9002
-
Container-title:Journal of Applied Probability
-
language:en
-
Short-container-title:J. Appl. Probab.
Author:
Boyd David W.,Steele J. Michael
Abstract
Suppose that n persons each know a different piece of information, and that whenever a pair of persons talk on the telephone each tells the other all the information that he knows at the time. If calls are made at random, we show that the expected number of calls necessary until everyone knows all n pieces of information is asymptotically 1.5 n log n. This sharpens an earlier result of J. W. Moon.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reachability and Expectation in Gossiping;PRIMA 2017: Principles and Practice of Multi-Agent Systems;2017
2. Random exchanges of information;Journal of Applied Probability;1981-09
3. Random exchanges of information;Journal of Applied Probability;1981-09