# On Mixing and Edge Expansion Properties in Randomized Broadcasting

- 147 Downloads
- 16 Citations

## Abstract

In this paper, we consider a popular randomized broadcasting algorithm called push-algorithm defined as follows. Initially, one vertex of a graph *G*=(*V*,*E*) owns a piece of information which is spread iteratively to all other vertices: in each timestep *t*=1,2,… every *informed* vertex chooses a neighbor uniformly at random and informs it. The question is how many time steps are required until all vertices become informed (with high probability).

For various graph classes, involved methods have been developed in order to show an upper bound of
\(\mathcal{O}(\log N+\mathop{\mathrm{diam}}(G))\)
on the runtime of the push-algorithm, where *N* is the number of vertices and
\(\mathop{\mathrm{diam}}(G)\)
denotes the diameter of *G*. However, no asymptotically tight bound on the runtime based on the mixing time of random walks has been established. In this work we fill this gap by deriving an upper bound of
\(\mathcal{O}(\mathsf {T}_{\mathop{\mathrm{mix}}}+\log N)\)
, where
\(\mathsf{T}_{\mathop{\mathrm{mix}}}\)
denotes the mixing time of a certain random walk on *G*. After that we prove upper bounds that are based on certain edge expansion properties of *G*. However, for hypercubes neither the bound based on the mixing time nor the bounds based on edge expansion properties are tight. That is why we develop a general way to combine these two approaches by which we can deduce that the runtime of the push-algorithm is *Θ*(log *N*) on every Hamming graph.

## Keywords

Randomized algorithm Distributed and parallel algorithm Markov chain## References

- 1.Bezrukov, S.L.: Edge isoperimetric problems on graphs. Graph Theory Comb. Biol.
**7**, 157–197 (1999) MathSciNetGoogle Scholar - 2.Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory IEEE/ACM Trans. Netw.
**52**(6), 2508–2530 (2006) CrossRefMathSciNetGoogle Scholar - 3.Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1–12 (1987) Google Scholar
- 4.Diaconis, P.: Group Representations in Probability and Statistics. Lecture Notes-Monograph Series, vol. 11 (1988) Google Scholar
- 5.Diaconis, P., Graham, R.L., Morrison, J.A.: Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Struct. Algorithms
**1**(1), 51–72 (1990) zbMATHCrossRefMathSciNetGoogle Scholar - 6.Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Comput.
**25**(7), 789–812 (1999) CrossRefMathSciNetGoogle Scholar - 7.Elsässer, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 148–157 (2006) Google Scholar
- 8.Elsässer, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. In: 17th International Symposium on Algorithms and Computation (ISAAC), pp. 349–358 (2006) Google Scholar
- 9.Elsässer, R., Sauerwald, T.: Broadcasting vs. mixing and information dissemination on Cayley graphs. In: 24th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 163–174 (2007) Google Scholar
- 10.Elsässer, R., Sauerwald, T.: On the power of memory in randomized broadcasting. In: 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 218–227 (2008) Google Scholar
- 11.Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Algorithms
**1**(4), 447–460 (1990) zbMATHCrossRefMathSciNetGoogle Scholar - 12.Ga̧sieniec, L., Pelc, A.: Adaptive broadcasting with faulty nodes. Parallel Comput.
**22**, 903–912 (1996) CrossRefGoogle Scholar - 13.Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes, 3rd edn. Oxford University Press, London (2001) Google Scholar
- 14.Hromkovic̆, J., Klasing, R., Pelc, A., Ruz̆ic̆ka, P., Unger, W.: Dissemination of Information in Communication Networks. Springer, Berlin (2005) Google Scholar
- 15.Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 565–574 (2000) Google Scholar
- 16.Leighton, T., Maggs, B., Sitamaran, R.: On the fault tolerance of some popular bounded-degree networks. In: 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 542–552 (1992) Google Scholar
- 17.Lindsey, J.H.: Optimal assignment of numbers to vertices. Am. Math. Mon.
**7**, 508–516 (1964) MathSciNetGoogle Scholar - 18.Lindvall, T.: Lectures on the Coupling Method. Wiley, New York (1992) zbMATHGoogle Scholar
- 19.Lovász, L.: Random walks on graphs: a survey. Comb. Paul Erdös Eighty
**2**, 1–46 (1993) Google Scholar - 20.Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005) zbMATHGoogle Scholar
- 21.Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995) zbMATHGoogle Scholar
- 22.Pittel, B.: On spreading a rumor. SIAM J. Appl. Math.
**47**(1), 213–223 (1987) zbMATHCrossRefMathSciNetGoogle Scholar - 23.McKendrick, A.G., Kermack, W.O.: Contributions to the mathematical theory of epidemics. Proc. R. Soc. Lond. Ser. A
**115**, 700–721 (1927) CrossRefGoogle Scholar - 24.Ross, S.: Introduction to Probability Models, 8th edn. Academic Press, San Diego (2003) zbMATHGoogle Scholar
- 25.Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Comb. Probab. Comput.
**1**, 351–370 (1996) MathSciNetGoogle Scholar