Asymptotics for pull on the complete graph

Konstantinos Panagiotou and Simon Reisser

Stochastic Processes and their Applications, 2023, vol. 159, issue C, 541-563

Abstract: We study the randomized rumor spreading algorithm pull on complete graphs with n vertices. Starting with one informed vertex and proceeding in rounds, each vertex that is uninformed connects to a neighbor chosen uniformly at random and receives the information, if the vertex it connected to is informed. The goal is to study the number of rounds needed to spread the information to everybody, also known as the runtime.

Keywords: Randomized Rumor Spreading; Complete Graph; Asymptotic Distribution (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414923000261
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:159:y:2023:i:c:p:541-563

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2023.01.017

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().