Pith. sign in

REVIEW

Total flooding time and rumor propagation on graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1601.07164 v1 pith:FZRJ5UKS submitted 2016-01-26 math.PR

Darcy Camargo , Serguei Popov This is my paper · ORCID
classification math.PR
keywords timegraphpropagationfloodinginformationinformationsproblemratio
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study a model of rumor propagation in discrete time where each site in the graph has initially a distinct information; we are interested in the number of "conversations" before the entire graph knows all informations. This problem can be described as a flooding time problem with multiple liquids. For the complete graph we compare the ratio between the expected propagation time for all informations and the corresponding time for a single information, obtaining the asymptotic ratio $3/2$ between them.

Discussion (0). Continue with ORCID to comment.

Pith tools