scientific article
From MaRDI portal
Publication:3549607
zbMATH Open1232.68183arXivmath/0612046MaRDI QIDQ3549607FDOQ3549607
Authors: Elchanan Mossel, Sebastien Roch 
Publication date: 5 January 2009
Full work available at URL: https://arxiv.org/abs/math/0612046
Title of this publication is not available (Why is that?)
Applications of graph theory (05C90) Social networks; opinion dynamics (91D30) Approximation algorithms (68W25)
Cited In (40)
- On non-progressive spread of influence through social networks
- Diffusion of defaults among financial institutions
- Combinatorial model and bounds for target set selection
- Triggering cascades on undirected connected graphs
- Treewidth governs the complexity of target set selection
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Optimal intervention in economic networks using influence maximization methods
- Higher order monotonicity and submodularity of influence in social networks: from local to global
- Minimizing the expected complete influence time of a social network
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
- How to Burn a Graph
- T. E. Harris' contributions to interacting particle systems and percolation
- On strict submodularity of social influence
- On general threshold and general cascade models of social influence
- Transmission errors and influence maximization in the voter model
- Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions
- Competitive and collaborative influence in social networks
- Approximating fixation probabilities in the generalized Moran process
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions
- Pricing geometric transportation networks
- A game-theoretic approach for modeling competitive diffusion over social networks
- A two-stage stochastic programming approach for influence maximization in social networks
- Schedules for marketing products with negative externalities
- Approximating fixation probabilities in the generalized Moran process
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
- Information diffusion in social sensing
- Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
- Influence analysis: A survey of the state-of-the-art
- Multi-attribute based influence maximization in social networks: algorithms and analysis
- Multi-attribute based influence maximization in social networks
- Burning a graph is hard
- Stability and recovery for independence systems
- PASS approximation: a framework for analyzing and designing heuristics
- An exact algorithm for robust influence maximization
- A note on maximizing the spread of influence in social networks
- Submodular functions are noise stable
- Approximation algorithms for pricing with negative network externalities
- Heterogeneous anomaly detection in social diffusion with discriminative feature discovery
- Opinion influence maximization problem in online social networks based on group polarization effect
- NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549607)
