Rumor spreading on random regular graphs and expanders

Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well‐studied push model . Assume that initially one node in a given network holds some piece of information. In each round, every one of the informed nodes chooses independently a neighbor uniformly at random and transmits the message to it. In this paper we consider random networks where each vertex has degree d ≥ 3, i.e., the underlying graph is drawn uniformly at random from the set of all d ‐regular graphs with n vertices. We show that with probability 1 ‐ o (1) the push model broadcasts the message to all nodes within (1 + o (1)) C d ln n rounds, where\documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*} C_d = \frac{1}{\ln\left(2\left(1-\frac{1}{d}\right)\right)} - \frac{1}{d\ln\left(1 - \frac{1}{d}\right)}.\end{align*}\end{document} Particularly, we can characterize precisely the effect of the node degree to the typical broadcast time of the push model. Moreover, we consider pseudo‐random regular networks, where we assume that the degree of each node is very large. There we show that the broadcast time is (1 + o (1)) C ln n with probability 1 ‐ o (1), where \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*}C = \lim_{d\to\infty}C_d = \frac{1}{\ln2} + 1\end{align*} \end{document} . © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013