Push is Fast on Sparse Random Graphs


We consider the classical push broadcast process on a large class of sparse random multigraphs that includes random power law graphs and multigraphs. Our analysis shows that for every ε > 0, whp O(log n) rounds are sufficient to inform all but an ε-fraction of the vertices. It is not hard to see that, e.g. for random power law graphs, the push process needs… (More)
DOI: 10.1137/140984063


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics