1 / 21

Measuring the Mixing Time of Social Graphs

Measuring the Mixing Time of Social Graphs. Abedelaziz Mohaisen , Aaram Yun, and Yongdae Kim Computer Science and Engineering Department University of Minnesota Twin Cities ACM Internet Measurement Conference. Nov. 1—3, 2010, Mel, Australia. Background.

velmaroberts
Download Presentation

Measuring the Mixing Time of Social Graphs

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. Measuring the Mixing Time of Social Graphs Abedelaziz Mohaisen, Aaram Yun, and Yongdae Kim Computer Science and Engineering Department University of Minnesota Twin Cities ACM Internet Measurement Conference Nov. 1—3, 2010, Mel, Australia

  2. Background • Sybil Attack: nodes with multiple fake identities • P2P, Sensor/Ad hoc networks, Reputation System • “The Sybil Attack” by John Douceur Impossibility of defending against the attack without a trusted centralized authority • A new direction Use of social networks to defend against Sybil attack without centralized authority IMC'10

  3. The new direction • SybilGuard [SIGCOMM’06] • SybilLimit [Oakland’08] • GateKeeper [PODC’10] • SybilInfer [NDSS’09] • SumUp [NSDI’09] • MobID [INFOCOM’10] • Whanau [NSDI’10] • … [SIGCOMM’10] IMC'10

  4. The Idea Verifier Attack edge Suspect Intersection node 10-15 per million nodes Limited # of attack edges IMC'10

  5. Main findings • Good news • Some Sybil defenses do not need ``fast mixing’’ graphs in order to work for ``good nodes’’. • Bad news • Social graphs are not fast mixing. • Some theoretical arguments in Sybil defenses are inaccurate. • The applicability of social network-based Sybil defenses is infeasible for some social graphs. • Negative correlation between trust and mixing. IMC'10

  6. The rest of this talk • Assumptions and Preliminaries • How to measure the mixing time • Results and Implications • Conclusion and Future Work IMC'10

  7. The assumptions reloaded • Trust in social network • Face-to-face network, not OSN • However… • Small mixing time • The cost and effectiveness of designs. • Number of accepted Sybils per attack edge. • Small number of attack edges • Justify the sparse-cut hypothesis. IMC'10

  8. Preliminaries • Social networks • Undirected graph, edges = interdependencies • A is the adjacency matrix • P is transition matrix, πis stationary distribution • Mixing time • The time to reach the stationary distribution IMC'10

  9. Computing the mixing time • Bounded by the second largest eigenvalue (µ) • Computed directly from the definition. • Methodology • Compute the lower bound as an indicator • Compute the mixing time of 1000 random sources selected uniformly at random in the social graph IMC'10

  10. Datasets IMC'10

  11. Main Results

  12. Slower mixing Slower mixing Faster mixing Big difference between the measurements using the two methods Difference across datasets is related to the social network model IMC'10

  13. Big difference between the measurements using the two methods Difference across datasets is related to the social network model IMC'10

  14. Physics 2 A few slow-mixing sources are enough to slow down the overall mixing of the network. The use of the mixing time, as the maximal time, for reasoning about Sybil defenses is inaccurate Physics 1 Physics 3 IMC'10

  15. Physics 3 Such slow mixing nodes represent a large percent of nodes in the social graph. Physics 1 Physics 2 IMC'10

  16. IMC'10

  17. Other measurements • The impact of trimming low degree nodes • Using the same method as in SIGCOMM’06 • Graph size reduced to only 20% of the original graph after trimming up to 5 degrees • The total variation distance moves from 0.2 to 0.03 for walk length of 100 (SLEM technique) • From 0.015 to 0.003 (sampling technique) • From 0.6 to 0.2 at walk length of 15 IMC'10

  18. Implication • What’s the amount of the mixing time we need indeed for these designs to work? IMC'10

  19. Conclusion • Measured the mixing time of several social networks using sampling • Showed that 2nd largest Eigenvalue is not accurate for representing the mixing of the whole graph. • Findings • Social graphs are slower mixing than anticipated and used • Negative correlation between trust and mixing time • Smaller walk length is sufficient to accept most honest nodes. • Still larger than theoretically assumed • Relaxed mixing assumption (larger statistical distance) IMC'10

  20. Future work IMC'10

  21. Measuring the Mixing Time of Social Graphs Abedelaziz Mohaisen, Aaram Yun, and Yongdae Kim Computer Science and Engineering Department University of Minnesota Twin Cities ACM Internet Measurement Conference Nov. 1—3, 2010, Mel, Australia

More Related