Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.12202/4355
Title: | Reframing the Gossip Problem as Information Spreading over Complex, Dynamic Networks. |
Other Titles: | Thesis submitted in partial fulfillment of the requirements of the Jay and Jeanie Schottenstein Honors Program, Yeshiva College, Yeshiva University, May 2018. |
Authors: | Shmalo, Yonah |
Keywords: | stable networks random algorithms structured algorithm cliques opinion formation consensus social networks friendship relationships |
Issue Date: | May-2018 |
Publisher: | Yeshiva College. Yeshiva University. |
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. |
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. |
Description: | The file is restricted for YU community access only. |
URI: | https://hdl.handle.net/20.500.12202/4355 https://ezproxy.yu.edu/login?url=https://repository.yu.edu/handle/20.500.12202/4355 |
Appears in Collections: | Jay and Jeanie Schottenstein Honors Student Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yonah Shmalo Senior Honors thesis 2018.pdf Restricted Access | PDF Rynhold OCR | 875.51 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License