{"paper":{"title":"Asynchronous Rumor Spreading on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Konstantinos Panagiotou, Leo Speidel","submitted_at":"2016-08-05T05:36:45Z","abstract_excerpt":"We perform a thorough study of various characteristics of the asynchronous push-pull protocol for spreading a rumor on Erd\\H{o}s-R\\'enyi random graphs $G_{n,p}$, for any $p>c\\ln(n)/n$ with $c>1$. In particular, we provide a simple strategy for analyzing the asynchronous push-pull protocol on arbitrary graph topologies and apply this strategy to $G_{n,p}$. We prove tight bounds of logarithmic order for the total time that is needed until the information has spread to all nodes. Surprisingly, the time required by the asynchronous push-pull protocol is asymptotically almost unaffected by the aver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01766","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}