Article contents
Random exchanges of information
Published online by Cambridge University Press: 14 July 2016
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.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1979
Footnotes
Present address: Department of Statistics, Stanford University, Stanford, CA 94305, U.S.A. Research supported in part by the National Research Council of Canada.
References
- 8
- Cited by