Submodularity of Influence in Social Networks: From Local to Global

DOI10.1137/080714452zbMath1232.91583OpenAlexW1970560785MaRDI QIDQ3068629

Sebastien Roch, Elchanan Mossel

Publication date: 17 January 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7b96a156c1baf2fdcec9ca998bfae4fc5ec59add

zbMATH Keywords

submodularitysocial networkscoupling methodgrowth process

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (19)

Complexity of equilibrium in competitive diffusion games on social networks ⋮ Strategyproof mechanisms for competitive influence in networks ⋮ Emerging Behavioral Consensus of Evolutionary Dynamics on Complex Networks ⋮ Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions ⋮ Higher order monotonicity and submodularity of influence in social networks: from local to global ⋮ Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization ⋮ Seeding with Costly Network Information ⋮ Unnamed Item ⋮ Spreading and Structural Balance on Signed Networks ⋮ Competitive contagion in networks ⋮ A two-stage stochastic programming approach for influence maximization in social networks ⋮ Coreness of cooperative games with truncated submodular profit functions ⋮ Large-scale influence maximization via maximal covering location ⋮ How to choose friends strategically ⋮ Competing first passage percolation on random regular graphs ⋮ Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem ⋮ Algorithms for influence maximization in socio-physical networks ⋮ Unnamed Item ⋮ On the compounding of higher order monotonic pseudo-Boolean functions

This page was built for publication: Submodularity of Influence in Social Networks: From Local to Global