How to Spread Rumors Fast

DOI10.2307/2691050MaRDI QIDQ4359123zbMATH OpenOpenAlexFDO

Authors C. Kenneth Fan, Bjorn Poonen, George Poonen

Publication date 11 December 1997

Full work available at URL https://doi.org/10.2307/2691050

zbMATH Keywords

computer connectivityoptimisation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Communication, information (94A99)

Review text

The authors establish bounds for the minimum time it takes for each of \(n\) people to share information, where each person starts with one piece of information unknown to the others, and in each step the people can exchange their information with only one other person. The result can be useful when interpreted in terms of communications between computers which are operating in parallel (where multiple copies of a database are distributed to several locations and replication is needed to keep the databases synchronized).

Recommendations

• How to discreetly spread a rumor in a crowd
• Spreading Rumors Rapidly Despite an Adversary
• On Spreading a Rumor
• How to Spread a Rumor
• Ultra-fast rumor spreading in social networks
• Faster rumor spreading with multiple calls
• Faster rumor spreading with multiple calls
• Rumor spreading: A trigger for proliferation or fading away
• Rumor Spreading in Social Networks

Cited in

(2)

• How to discreetly spread a rumor in a crowd
• How does rumor spreading affect people inside and outside an institution

This page was built for publication: How to Spread Rumors Fast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359123)