Minimizing the Spread of Rumor Within Budget Constraint in Online Network

DOI10.1007/978-981-15-0105-0_9MaRDI QIDQ3305478zbMATH OpenOpenAlexFDO

Authors Songsong Mo, Shan Tian, Liwei Wang, Zhiyong Peng

Publication date 7 August 2020

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-15-0105-0_9

zbMATH Keywords

budget constraintrandom walkrumor controlsocial network

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• Minimize the impact of rumors by optimizing the control of comments on the complex network
• Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors
• Defending against online social network rumors through optimal control approach
• Modeling a rumor propagation in online social network: an optimal control approach
• Minimum budget for misinformation detection in online social networks with provable guarantees
• Minimum budget for misinformation blocking in online social networks
• A discrete mathematical modeling and optimal control of the rumor propagation in online social network

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• scientific article; zbMATH DE number 3194856 (Why is no real title available?)
• Introduction to algorithms.
• The budgeted maximum coverage problem

Cited in

(12)

• Maximizing misinformation restriction within time and budget constraints
• Containment of rumor spread by selecting immune nodes in social networks
• Rumor correction maximization problem in social networks
• Cost-effective anti-rumor message-pushing schemes
• Minimum budget for misinformation detection in online social networks with provable guarantees
• Community-based rumor blocking maximization in social networks: algorithms and analysis
• Minimum budget for misinformation blocking in online social networks
• General rumor blocking: an efficient random algorithm with martingale approach
• Centralized and decentralized rumor blocking problems
• Rumor blocking strategies considering user experience in online social network
• Controlling spread of rumor using neighbor centrality
• Blocking rumor by cut

This page was built for publication: Minimizing the Spread of Rumor Within Budget Constraint in Online Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305478)