13 search results - page 3 / 3 » Rumor Spreading on Random Regular Graphs and Expanders |
SIGMETRICS
2003
ACM
13 years 10 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
CPC
2006
13 years 4 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
ADHOCNOW
2004
Springer
13 years 10 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...