In this paper we tackle the following question: is it possible to predict the characteristics of the evolution of an epidemic process in a social network on the basis of the degree distribution alone? We answer this question affirmatively for several diffusion processes-- Push-Pull, Broadcast and SIR-- by showing that it is possible to predict with good accuracy their average evolution. We do this by developing a space efficient predictor that makes it possible to handle very large networks with very limited computational resources. Our experiments show that the prediction is surprisingly good for many instances of real-world networks. The class of real-world networks for which this happens can be characterized in terms of their neighbourhood function, which turns out to be similar to that of random networks. Finally, we analyse real instances of rumour spreading in Twitter and observe that our model describes qualitatively well their evolution.

Spreading Rumours without the Network / P., Brach; Epasto, Alessandro; Panconesi, Alessandro; Sankowski, P. i.. - ELETTRONICO. - (2014), pp. 107-118. (Intervento presentato al convegno The second ACM conference on Online social networks tenutosi a Dublin nel Oct 2014) [10.1145/2660460.2660472].

Spreading Rumours without the Network

EPASTO, ALESSANDRO;PANCONESI, Alessandro;
2014

Abstract

In this paper we tackle the following question: is it possible to predict the characteristics of the evolution of an epidemic process in a social network on the basis of the degree distribution alone? We answer this question affirmatively for several diffusion processes-- Push-Pull, Broadcast and SIR-- by showing that it is possible to predict with good accuracy their average evolution. We do this by developing a space efficient predictor that makes it possible to handle very large networks with very limited computational resources. Our experiments show that the prediction is surprisingly good for many instances of real-world networks. The class of real-world networks for which this happens can be characterized in terms of their neighbourhood function, which turns out to be similar to that of random networks. Finally, we analyse real instances of rumour spreading in Twitter and observe that our model describes qualitatively well their evolution.
2014
The second ACM conference on Online social networks
Rumour Spreading; Configuration Model; Algorithms
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Spreading Rumours without the Network / P., Brach; Epasto, Alessandro; Panconesi, Alessandro; Sankowski, P. i.. - ELETTRONICO. - (2014), pp. 107-118. (Intervento presentato al convegno The second ACM conference on Online social networks tenutosi a Dublin nel Oct 2014) [10.1145/2660460.2660472].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/760497
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact