Submodularity of influence in social networks: from local to global
DOI10.1137/080714452zbMATH Open1232.91583OpenAlexW1970560785MaRDI QIDQ3068629FDOQ3068629
Authors: Elchanan Mossel, Sebastien Roch 
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
Recommendations
- Higher order monotonicity and submodularity of influence in social networks: from local to global
- On strict submodularity of social influence
- Beyond worst-case (in)approximability of nonsubmodular influence maximization
- Automata, Languages and Programming
- Influence maximization in switching-selection threshold models
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30)
Cited In (23)
- On the compounding of higher order monotonic pseudo-Boolean functions
- How to choose friends strategically
- Complexity of equilibrium in competitive diffusion games on social networks
- Competing first passage percolation on random regular graphs
- Seeding with Costly Network Information
- Higher order monotonicity and submodularity of influence in social networks: from local to global
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Title not available (Why is that?)
- Influence maximization in switching-selection threshold models
- Emerging behavioral consensus of evolutionary dynamics on complex networks
- Large-scale influence maximization via maximal covering location
- Strategyproof mechanisms for competitive influence in networks
- Spreading and Structural Balance on Signed Networks
- Beyond worst-case (in)approximability of nonsubmodular influence maximization
- Average submodularity of maximizing anticoordination in network games
- A two-stage stochastic programming approach for influence maximization in social networks
- Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions
- Coreness of cooperative games with truncated submodular profit functions
- Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization
- Sketching valuation functions
- Competitive contagion in networks
- Adaptivity gap for influence maximization with linear threshold model on trees
- Algorithms for influence maximization in socio-physical networks
This page was built for publication: Submodularity of influence in social networks: from local to global
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068629)
