Approximating special social influence maximization problems

Social Influence Maximization Problems (SIMPs) deal with selecting k seeds in a given Online Social Network (OSN) to maximize the number of eventually-influenced users. This is done by using these seeds based on a given set of influence probabilities among neighbors in the OSN. Although the SIMP has been proved to be NP-hard, it has both submodular (with a natural diminishing-return) and monotone (with an increasing influenced users through propagation) that make the problem suitable for approximation solutions. However, several special SIMPs cannot be modeled as submodular or monotone functions. In this paper, we look at several conditions under which non-submodular or non-monotone functions can be handled or approximated. One is a profit-maximization SIMP where seed selection cost is included in the overall utility function, breaking the monotone property. The other is a crowd-influence SIMP where crowd influence exists in addition to individual influence, breaking the submodular property. We then review several new techniques and notions, including double-greedy algorithms and the supermodular degree, that can be used to address special SIMPs. Our main results show that for a specific SIMP model, special network structures of OSNs can help reduce its time complexity of the SIMP.

[1]  Vahab S. Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[2]  Joseph Naor,et al.  A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[3]  Jie Wu,et al.  NSFA: Nested Scale-Free Architecture for scalable publish/subscribe over P2P networks , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

[4]  Panos M. Pardalos,et al.  Greedy approximations for minimum submodular cover with submodular cost , 2010, Comput. Optim. Appl..

[5]  Andrzej Krawiecki,et al.  Majority-Vote Model on Scale-Free Hypergraphs , 2015 .

[6]  Harald Steck,et al.  Circle-based recommendation in online social networks , 2012, KDD.

[7]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Jian Pei,et al.  When Social Influence Meets Item Inference , 2015, KDD.

[9]  Ning Wang,et al.  Non-Submodularity and Approximability: Influence Maximization in Online Social Networks , 2019, 2019 IEEE 20th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[10]  Rong Zheng,et al.  On Budgeted Influence Maximization in Social Networks , 2012, IEEE Journal on Selected Areas in Communications.

[11]  Moran Feldman,et al.  Constrained Monotone Function Maximization and the Supermodular Degree , 2014, APPROX-RANDOM.

[12]  Jan Vondrák,et al.  Optimal approximation for submodular and supermodular optimization with bounded curvature , 2013, SODA.

[13]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[14]  S. Fujishige,et al.  A Submodular Function Minimization Algorithm Based on the Minimum-Norm Base ⁄ , 2009 .

[15]  Junsong Yuan,et al.  Profit maximization for viral marketing in Online Social Networks , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

[16]  Shaddin Dughmi,et al.  Algorithmic information structure design: a survey , 2017, SECO.

[17]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[18]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[19]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[20]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.