Rumor Spreading on Random Regular Graphs and Expanders

  title={Rumor Spreading on Random Regular Graphs and Expanders},
  author={Nikolaos Fountoulakis and Konstantinos Panagiotou},
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… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 18 references

Expander graphs and their applications

N. Linial S. Hoory, A. Wigderson
Bull . AMS • 2006

Query protocols for highly resilient peertopeer networks

G. Pandrurangan S. Jagannathan, S. Srinivasan
Proceedings of the ISCA 19 th International Conference on Parallel and Distributed Computing Systems ( ISCA PDCS ’ 06 ) • 2006

A proof of Alon ’ s second eigenvalue conjecture

A. Huber N. Fountoulakis, K. Panagiotou, J. Friedman
Proceedings of the 35 th annual ACM Symposium on Theory of Computing ( STOC ’ 03 ) • 2003

Building lowdiameter peertopeer networks

M. Talagrand
IEEE Journal on Selected Areas in Communications • 2003

Concentration for independent permutations

A. Nilli
Combinatorics , Probability and Computing • 2002

Similar Papers

Loading similar papers…