Maximizing multiple influences and fair seed allocation on multilayer social networks

The dissemination of information on networks involves many important practical issues, such as the spread and containment of rumors in social networks, the spread of infectious diseases among the population, commercial propaganda and promotion, the expansion of political influence and so on. One of the most important problems is the influence-maximization problem which is to find out k most influential nodes under a certain propagate mechanism. Since the problem was proposed in 2001, many works have focused on maximizing the influence in a single network. It is a NP-hard problem and the state-of-art algorithm IMM proposed by Youze Tang et al. achieves a ratio of 63.2% of the optimum with nearly linear time complexity. In recent years, there have been some works of maximizing influence on multilayer networks, either in the situation of single or multiple influences. But most of them study seed selection strategies to maximize their own influence from the perspective of participants. In fact, the problem from the perspective of network owners is also worthy of attention. Since network participants have not had access to all information of the network for reasons such as privacy protection and corporate interests, they may have access to only part of the social network. The owners of networks can get the whole picture of the networks, and they need not only to maximize the overall influence, but also to consider allocating seeds to their customers fairly, i.e., the Fair Seed Allocation (FSA) problem. As far as we know, FSA problem has been studied on a single network, but not on multilayer networks yet. From the perspective of network owners, we propose a multiple-influence diffusion model MMIC on multilayer networks and its FSA problem. Two solutions of FSA problem are given in this paper, and we prove theoretically that our seed allocation schemes are greedy. Subsequent experiments also validate the effectiveness of our approaches.

[1]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[2]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

[3]  Ibrahima Gaye,et al.  Multi-diffusion Degree Centrality Measure to Maximize the Influence Spread in the Multilayer Social Networks , 2016, AFRICOMM.

[4]  Jie Zhang,et al.  Community Size Effects on Epidemic Spreading in Multiplex Social Networks , 2016, PloS one.

[5]  Xin Jiang,et al.  Two-stage effects of awareness cascade on epidemic spreading in multiplex networks. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[7]  Yifei Yuan,et al.  Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate , 2011, SDM.

[8]  Ljupco Kocarev,et al.  Modeling the Spread of Multiple Contagions on Multilayer Networks , 2017 .

[9]  Donghyun Kim,et al.  Rumor restriction in Online Social Networks , 2013, 2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC).

[10]  Yamir Moreno,et al.  Dynamics of rumor spreading in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[12]  Rok Sosic,et al.  SNAP , 2016, ACM Trans. Intell. Syst. Technol..

[13]  Federico Vazquez,et al.  Interacting opinion and disease dynamics in multiplex networks: Discontinuous phase transition and nonmonotonic consensus times , 2016, Physical review. E.

[14]  Antoine Allard,et al.  Modeling the dynamical interaction between epidemics on overlay networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Katarzyna Musial,et al.  Interacting Spreading Processes in Multilayer Networks: A Systematic Review , 2019, IEEE Access.

[16]  Ken T D Eames,et al.  Networks of influence and infection: parental choices and childhood disease , 2009, Journal of The Royal Society Interface.

[17]  Deying Li,et al.  Maximizing the Influence and Profit in Social Networks , 2017, IEEE Transactions on Computational Social Systems.

[18]  Sergio Gómez,et al.  Competing spreading processes on multiplex networks: awareness and epidemics , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Vito Latora,et al.  Collective Phenomena Emerging from the Interactions between Dynamical Processes in Multiplex Networks. , 2014, Physical review letters.

[20]  Sebastian Funk,et al.  Interacting epidemics on overlay networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

[22]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[23]  Laks V. S. Lakshmanan,et al.  The bang for the buck: fair competitive viral marketing from the host perspective , 2013, KDD.

[24]  Stefan M. Wild,et al.  Maximizing influence in a competitive social network: a follower's perspective , 2007, ICEC.

[25]  Jianzhong Li,et al.  Retrieving the maximal time-bounded positive influence set from social networks , 2016, Personal and Ubiquitous Computing.

[26]  K-I Goh,et al.  Multiplexity-facilitated cascades in networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Albert-László Barabási,et al.  Understanding the Spreading Patterns of Mobile Phone Viruses , 2009, Science.

[28]  Haijuan Zang,et al.  The effects of global awareness on the spreading of epidemics in multiplex networks , 2018 .

[29]  Deying Li,et al.  Fair Multi-influence Maximization in Competitive Social Networks , 2017, WASA.

[30]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.