Rumor Spreading on Percolation Graphs

Details Rumor Spreading on Percolation Graphs Rumor Spreading on Percolation Graphs

2011-10-05

arxiv.org/abs/1110.1044v1

Mathematics

Probability

Scientific paper

We study the relation between the performance of the randomized rumor spreading (push model) in a d-regular graph G and the performance of the same algorithm in the percolated graph G_p. We show that if the push model successfully broadcast the rumor within T rounds in the graph G then only (1 + \epsilon)T rounds are needed to spread the rumor in the graph G_p when T = o(pd).

Affiliated with

Also associated with

No associations

Rating

Rumor Spreading on Percolation Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rumor Spreading on Percolation Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rumor Spreading on Percolation Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-325862