Suppressing Information Diffusion via Link Blocking in Temporal Networks

Conference Paper (2020)
Author(s)

X. Zhan (TU Delft - Multimedia Computing)

A Hanjalic (TU Delft - Intelligent Systems)

Huijuan Wang (TU Delft - Multimedia Computing)

Multimedia Computing
Copyright
© 2020 X. Zhan, A. Hanjalic, H. Wang
DOI related publication
https://doi.org/10.1007/978-3-030-36687-2_37
More Info
expand_more
Publication Year
2020
Language
English
Copyright
© 2020 X. Zhan, A. Hanjalic, H. Wang
Multimedia Computing
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Volume number
1
Pages (from-to)
448-458
ISBN (print)
978-3-030-36686-5
ISBN (electronic)
978-3-030-36687-2
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In this paper, we explore how to effectively suppress the diffusion of (mis)information via blocking/removing the temporal contacts between selected node pairs. Information diffusion can be modelled as, e.g., an SI (Susceptible-Infected) spreading process, on a temporal social network: an infected (information possessing) node spreads the information to a susceptible node whenever a contact happens between the two nodes. Specifically, the link (node pair) blocking intervention is introduced for a given period and for a given number of links, limited by the intervention cost. We address the question: which links should be blocked in order to minimize the average prevalence over time? We propose a class of link properties (centrality metrics) based on the information diffusion backbone [19], which characterizes the contacts that actually appear in diffusion trajectories. Centrality metrics of the integrated static network have also been considered. For each centrality metric, links with the highest values are blocked for the given period. Empirical results on eight temporal network datasets show that the diffusion backbone based centrality methods outperform the other metrics whereas the betweenness of the static network, performs reasonably well especially when the prevalence grows slowly over time.

Files

978_3_030_36687_2_37.pdf
(pdf | 0.805 Mb)
- Embargo expired in 01-07-2020
License info not available