Mathematics – Probability
Scientific paper
2010-11-27
Mathematics
Probability
15 pages, 1 figure
Scientific paper
In this paper, we study the impact of edge weights on distances in diluted random graphs. We interpret these weights as delays, and take them as i.i.d exponential random variables. We analyze the weighted flooding time defined as the minimum time needed to reach all nodes from one uniformly chosen node, and the weighted diameter corresponding to the largest distance between any pair of vertices. Under some regularity conditions on the degree sequence of the random graph, we show that these quantities grow as the logarithm of $n$, when the size of the graph $n$ tends to infinity. We also derive the exact value for the prefactors. These allow us to analyze an asynchronous randomized broadcast algorithm for random regular graphs. Our results show that the asynchronous version of the algorithm performs better than its synchronized version: in the large size limit of the graph, it will reach the whole network faster even if the local dynamics are similar on average.
Amini Hamed
Draief Moez
Lelarge Marc
No associations
LandOfFree
Flooding in Weighted Random 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 Flooding in Weighted Random Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flooding in Weighted Random Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-589379