A note on maximizing the spread of influence in social networks

DOI10.1016/j.ipl.2010.11.015zbMath1260.68295OpenAlexW1993002652MaRDI 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 algorithmsvoter modelsocial networkapproximation algorithmsspread maximization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (7)

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

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

This page was built for publication: A note on maximizing the spread of influence in social networks