BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Information Spreading on Networks - Charlotte Out
DTSTART:20230606T120000Z
DTEND:20230606T130000Z
UID:TALK200554@talks.cam.ac.uk
CONTACT:Mateja Jamnik
DESCRIPTION:We study a rumor spreading model where individuals are connect
 ed via a network structure. Initially\, only a small subset of the individ
 uals are spreading a rumor. Each individual who is connected to a spreader
 \, starts spreading the rumor with some probability as a function of their
  trust in the spreader\, quantified by the Jaccard similarity index.\nFurt
 hermore\, the probability that a spreader diffuses the rumor decreases ove
 r time until they fully lose their interest and stop spreading.\n\nWe focu
 s on determining the graph parameters which govern the magnitude and pace 
 that the rumor spreads in this model. We prove that for the rumor to sprea
 d to a sizable fraction of the individuals\, the network needs to enjoy ``
 strong'' expansion properties and most nodes should be in ``well-connected
 '' communities. Both of these characteristics are\, arguably\, present in 
 real-world social networks up to a certain degree\, shedding light on the 
 driving force behind the extremely fast spread of rumors in social network
 s.\n\nFurthermore\, we formulate a large range of countermeasures to cease
  the spread of a rumor. We introduce four fundamental criteria which a cou
 ntermeasure ideally should possess. We evaluate all the proposed counterme
 asures by conducting experiments on real-world social networks such as Fac
 ebook and Twitter. We conclude that our novel decentralized countermeasure
 s (which are executed by the individuals) generally outperform the previou
 sly studied centralized  ones (which need to be imposed by a third entity 
 such as the government).\n\n\n\n"You can also join us on Zoom":https://zoo
 m.us/j/99166955895?pwd=SzI0M3pMVEkvNmw3Q0dqNDVRalZvdz09
LOCATION:Computer Lab\, SS03
END:VEVENT
END:VCALENDAR