About: Many researchers from a variety of fields including computer science, network science and mathematics have focused on how to contain the outbreaks of Internet misinformation that threaten social systems and undermine societal health. Most research on this topic treats the connections among individuals as static, but these connections change in time, and thus social networks are also temporal networks. Currently there is no theoretical approach to the problem of containing misinformation outbreaks in temporal networks. We thus propose a misinformation spreading model for temporal networks and describe it using a new theoretical approach. We propose a heuristic-containing (HC) strategy based on optimizing final outbreak size that outperforms simplified strategies such as those that are random-containing (RC) and targeted-containing (TC). We verify the effectiveness of our HC strategy on both artificial and real-world networks by performing extensive numerical simulations and theoretical analyses. We find that the HC strategy greatly increases the outbreak threshold and decreases the final outbreak threshold.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : wasabi.inria.fr associated with source document(s)

AttributesValues
type
value
  • Many researchers from a variety of fields including computer science, network science and mathematics have focused on how to contain the outbreaks of Internet misinformation that threaten social systems and undermine societal health. Most research on this topic treats the connections among individuals as static, but these connections change in time, and thus social networks are also temporal networks. Currently there is no theoretical approach to the problem of containing misinformation outbreaks in temporal networks. We thus propose a misinformation spreading model for temporal networks and describe it using a new theoretical approach. We propose a heuristic-containing (HC) strategy based on optimizing final outbreak size that outperforms simplified strategies such as those that are random-containing (RC) and targeted-containing (TC). We verify the effectiveness of our HC strategy on both artificial and real-world networks by performing extensive numerical simulations and theoretical analyses. We find that the HC strategy greatly increases the outbreak threshold and decreases the final outbreak threshold.
subject
  • Network theory
  • Computer-related introductions in 1989
  • New media
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software