Suppressing Information Diffusion via Link Blocking in Temporal Networks

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.

[1]  Mark C. Parsons,et al.  Communicability across evolving networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Naoki Masuda,et al.  Random walk centrality for temporal networks , 2014, ArXiv.

[3]  Alain Barrat,et al.  Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys , 2015, PloS one.

[4]  Guanghui Wang,et al.  Temporal information gathering process for node ranking in time-varying networks. , 2019, Chaos.

[5]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[6]  Przemyslaw Kazienko,et al.  Matching Organizational Structure and Social Network Extracted from Email Communication , 2011, BIS.

[7]  Petter Holme,et al.  Modern temporal network theory: a colloquium , 2015, The European Physical Journal B.

[8]  Harry Eugene Stanley,et al.  Correlation between centrality metrics and their application to the opinion model , 2014, The European Physical Journal B.

[9]  Ciro Cattuto,et al.  What's in a crowd? Analysis of face-to-face behavioral networks , 2010, Journal of theoretical biology.

[10]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[11]  Juan-Juan Cai,et al.  Characterizing Temporal Bipartite Networks - Sequential- Versus Cross-Tasking , 2018, COMPLEX NETWORKS.

[12]  Ciro Cattuto,et al.  High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School , 2011, PloS one.

[13]  Alan Hanjalic,et al.  Information diffusion backbones in temporal networks , 2018, Scientific Reports.

[14]  Kazuo Yano,et al.  Importance of individual events in temporal networks , 2012, ArXiv.

[15]  Xiaoqi Ma,et al.  Identifying influential spreaders by gravity model , 2019, Scientific Reports.

[16]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[18]  Alain Barrat,et al.  Contact Patterns among High School Students , 2014, PloS one.

[19]  Ernesto Estrada,et al.  Communicability in temporal networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.