1 / 37

Luby’s MIS Distributed Algorithm

Luby’s MIS Distributed Algorithm. Runs in time. with high probability. This algorithm is asymptotically better than the previous one. Let be the degree of node. 2. 1. At each phase :. Each node elects itself with probability. degree of in. 2. 1.

jonnas
Télécharger la présentation

Luby’s MIS Distributed Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Luby’s MIS Distributed Algorithm Runs in time with high probability This algorithm is asymptotically better than the previous one.

  2. Let be the degree of node 2 1

  3. At each phase : Each node elects itself with probability degree of in 2 1 Elected nodes are candidates for the independent set

  4. If two neighbors are elected simultaneously, then the higher degree node wins Example: if

  5. If both have the same degree, ties are broken arbitrarily Example: if

  6. Using previous rules, problematic nodes are removed Problematic nodes

  7. The remaining elected nodes form independent set

  8. Analysis Consider phase A good event for node at least one neighbor enters 2 1

  9. If is true, then and will disappear at the end of current phase At the end of phase

  10. At least one neighbor of elects itself with probability at least LEMMA 1: maximum neighbor degree 2 1

  11. PROOF: No neighbor of elects itself with probability (the elections are independent) 2 1

  12. maximum neighbor degree

  13. Therefore, at least one neighbor of Elects itself with probability at least 2 1 END OF PROOF

  14. LEMMA 2: If a node elects itself, then it enters with probability at least 2 2 1 1

  15. PROOF: Node enters if no neighbor of same or higher degree elect itself 2 1

  16. Probability that some neighbor of with same or higher degree elects itself 2 1 neighbors of same or higher degree

  17. Probability that that no neighbor of with same or higher degree elects itself 2 1 neighbors of same or higher degree

  18. 2 2 1 1 Thus, if elects itself, it enters with probability at least END OF PROOF

  19. LEMMA 3: at least one neighbor of enters 2 1

  20. PROOF: New event neighbor is in and no node is elected 2 1

  21. The events are mutually exclusive

  22. It holds: Therefore:

  23. elects itself and no node elects itself after elects itself, it enters 2 1

  24. after elects itself, it enters (from Lemma 2) 2 2 1 1

  25. elects itself and no node elects itself The events are mutually exclusive

  26. We showed earlier (Lemma 1) that: Therefore:

  27. Therefore node disappears in phase with probability at least END OF PROOF

  28. Let be the maximum node degree in the graph Suppose that in : Then, constant

  29. Thus, in phase a node with degree disappears with probability at least (thus, nodes with high degree will disappear fast)

  30. Consider a node which in initial graph has degree Suppose that the degree of remains at least for the next phases Node does not disappear within phases with probability at most

  31. Take Node does not disappear within phases with probability at most

  32. Thus, within phases either disappears or its degree gets less than with probability at least

  33. Therefore, by the end of phases there is no node of degree higher than with probability at least (ineq. 2)

  34. In every phases, the maximum degree of the graph reduces by at least half, with probability at least

  35. Maximum number of phases until degree drops to 0 (MIS has formed) with probability at least (ineq. 2)

  36. Total number of phases: with high probability Time duration of each phase: Total time:

More Related