1 / 77

Rumour Spreading in Social Networks

Rumour Spreading in Social Networks. Alessandro Panconesi Dipartimento di Informatica Joint work with Flavio Chierichetti and Silvio Lattanzi. Rumours spread quickly. OUR GOAL. Argue in a rigorous way that rumours spread quickly in a social network. How to tackle the problem.

wesley
Download Presentation

Rumour Spreading in Social Networks

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. Rumour Spreading in Social Networks Alessandro Panconesi Dipartimento di Informatica Joint work with Flavio Chierichetti and Silvio Lattanzi

  2. Rumours spread quickly

  3. OUR GOAL Argue in a rigorous way that rumours spread quickly in a social network

  4. How to tackle the problem

  5. How to tackle the problem

  6. OUR GOAL Prove that rumours spread quickly in a social network

  7. Gossip: a very simple model

  8. Gossiping

  9. Gossiping

  10. Gossiping

  11. Gossiping

  12. Gossiping

  13. Gossiping

  14. Gossiping

  15. Gossiping Variants PUSH Node with information sends to a random neighbour

  16. Gossiping Variants PUSH Node with information sends to a random neighbour PULL Node without information asks a random neighbour

  17. Gossiping Variants PUSH-PULL PUSH Node with information sends to a random neighbour PULL Node without information asks a random neighbour

  18. Motivation • Technological: Rumour spreading algorithms are widely used in communication networks which, more and more, are likely to exhibit a social dimension. This knowledge might be exploited for more efficient communication protocols • Sociological: rumour spreading is a basic, simple form of a contagion dynamics. By studying it we hope to gain some insight into more complex diffusion phenomena

  19. Previous Work

  20. Different approach We are looking for necessary and/or sufficient conditions for rumour spreading to be fast in a given network

  21. Push

  22. Push

  23. Push

  24. Push

  25. Push

  26. Push

  27. Pull

  28. Pull

  29. Pull

  30. Pull

  31. Pull

  32. Pull

  33. Both Push and Pull are hopeless

  34. Therefore, we consider Push-Pull, quite appropriately in the Age of the Internet

  35. Push

  36. Push Pull

  37. Push Pull Push-Pull

  38. OUR GOAL Prove that rumours spread quickly in a social network

  39. Time is of the essence

  40. Gossiping 0

  41. Gossiping 1

  42. Gossiping 1

  43. Gossiping 1

  44. Gossiping 2

  45. Gossiping 2

  46. Gossiping 3

  47. Time is of the essence Time = #rounds Speed = Time is poly-logarithmic

  48. OUR GOAL Prove that rumours spread quickly in a social network

  49. Recall our goal.. Prove that rumours spread quickly in a social network Problem formulation: How many rounds will it take Push-Pull to broadcast a message in a social network?

More Related