Supervision : Matthieu LATAPY

Co-supervision : TARISSAN Fabien

Information Diffusion in Complex Networks: Measurement-Based Analysis Applied to Modelling

Understanding information diffusion on complex networks is a key issue from a theoretical and applied perspective. Epidemiology-inspired SIR models have been proposed to model information diffusion. Recent papers have analyzed this question from a data-driven perspective, using on-line diffusion data. We follow this approach, investigating if epidemic models, calibrated with a systematic procedure, are capable of reproducing key structural properties of spreading cascades. We first identified a large-scale, rich dataset from which we can reconstruct the diffusion trail and the underlying network. Secondly, we examine the simple SIR model as a baseline model and conclude that it was unable to generate structurally realistic spreading cascades. We extend this result examining model extensions which take into account heterogeneities observed in the data. In contrast, similar models which take into account temporal patterns (which can be estimated with the interaction data) generate more similar cascades qualitatively. Although one key property was not reproduced in any model, this result highlights the importance of temporal patterns to model diffusion phenomena. We have also analyzed the impact of the underlying network topology on synthetic spreading cascade structure. We have simulated spreading cascades in similar conditions as the real cascades observed in our dataset, namely, with the same time constraints and with the same "seeds". Using a sequence of uniformly random graphs derived from the real graph and with increasing structure complexity, we have examined the impact of key topological properties for the models presented previously. We show that in our setting, the distribution of the number of neighbors of seed nodes is the most impacting property among the investigated ones.

2012-2019 Publications

• 2019
  • L. Tabourier, D. Bernardes, A.‑S. Libert, R. Lambiotte : “RankMerging: A supervised learning-to-rank framework to predict links in large social networks”, Machine Learning, vol. 108 (10), pp. 1729-1756, (Springer Verlag) (2019)
• 2014
  • D. Bernardes : “Information Diffusion in Complex Networks: Measurement-Based Analysis Applied to Modelling”, thesis, phd defence 03/21/2014, supervision Latapy, Matthieu, co-supervision : Tarissan, Fabien (2014)
  • R. Hollanders, D. Bernardes, B. Mitra, R. Jungers, J.‑Ch. Delvenne, F. Tarissan : “Data-driven traffic and diffusion modeling in peer-to-peer networks: A real case study”, Network Science, vol. 2 (3), pp. 341-366, (Cambridge University Press) (2014)
• 2013
  • D. Bernardes, M. Latapy, F. Tarissan : “Inadequacy of SIR Model to Reproduce Key Properties of Real-world Spreading Phenomena: Experiments on a Large-scale P2P System”, Social Network Analysis and Mining, vol. 3 (4), pp. 1195-1208, (Springer) (2013)
• 2012
  • D. Bernardes, M. Latapy, F. Tarissan : “Examining Key Properties of Diffusion Models for Large-Scale Real-World Networks”, Quatorzièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel’12), La Grande Motte, France, pp. 1-4 (2012)
  • D. Bernardes, M. Latapy, F. Tarissan : “Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System”, IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Istanbul, Turkey, pp. 327-334, (IEEE) (2012)