Description
The file is restricted for YU community access only.
Abstract
In the following paper we present a new proof to the gossip problem which
considers the minimal amount of conversations needed to circulate n pieces of
information held by n actors, where upon one conversation between two actors
they share all of the information they have accumulated. We will also present a
computational strategy that will allow us to verify the complete spread of
information after a sequence of conversations, analyze the distribution of
information held by all of the actors and track information propagation under
non-ideal sequences of conversations.
Citation
Reframing the Gossip Problem as Information Spreading over Complex, Dynamic Networks. Shmalo, Yonah. Thesis submitted in partial fulfillment of the requirements of the Jay and Jeanie Schottenstein Honors Program, Yeshiva College, Yeshiva University, May 2018.
*This is constructed from limited available data and may be imprecise.