A note on maximizing the spread of influence in social networks

DOI10.1016/j.ipl.2010.11.015zbMath1260.68295MaRDI QIDQ1944068

Asaf Shapira, Eyal Even-Dar

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.015

zbMATH Keywords

analysis of algorithms; voter model; social network; approximation algorithms; spread maximization

Mathematics Subject Classification ID

68W40: Analysis of algorithms

91D30: Social networks; opinion dynamics

68R10: Graph theory (including graph drawing) in computer science

68W25: Approximation algorithms

Related Items

Voter Model on Signed Social Networks, Unnamed Item, Deprecation based greedy strategy for target set selection in large scale social networks, Optimizing node discovery on networks: problem definitions, fast algorithms, and observations, Competitive diffusion in signed social networks: a game-theoretic perspective, Cooperation through social influence, Influence analysis: A survey of the state-of-the-art

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• A New Product Growth for Model Consumer Durables
• Finite particle systems and infection models
• Fast Approximation Algorithms for Knapsack Problems
• A model for spatial conflict
• Automata, Languages and Programming