|
[1] D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2003, pp. 137-146. [2] S. Bharathi, D. Kempe, and M. Salek, "Competitive influence maximization in social networks," in International workshop on web and internet economics. Springer, 2007, pp. 306-311. [3] T. Carnes, C. Nagarajan, S. M. Wild, and A. Van Zuylen, "Maximizing in uence in a competitive social network: a follower's perspective," in Proceedings of the ninth international conference on Electronic commerce. ACM, 2007, pp. 351-360. [4] J. Kostka, Y. A. Oswald, and R. Wattenhofer, "Word of mouth: Rumor dissemination in social networks," in International colloquium on structural information and communication complexity. Springer, 2008, pp. 185-196. [5] X. He, G. Song, W. Chen, and Q. Jiang, "Influence blocking maximization in social networks under the competitive linear threshold model," in Proceedings of the 2012 siam international conference on data mining. SIAM, 2012, pp. 463-474. [6] S. Shirazipourazad, B. Bogard, H. Vachhani, A. Sen, and P. Horn, "Influence propagation in adversarial setting: how to defeat competition with least amount of investment," in Proceedings of the 21st ACM international conference on Information and knowledge management. ACM, 2012, pp. 585-594. [7] S.-C. Lin, S.-D. Lin, and M.-S. Chen, "A learning-based framework to handle multiround multi-party influence maximization on social networks," in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2015, pp. 695-704. [8] Y. Lin and J. C. Lui, "Analyzing competitive influence maximization problems with partial information: An approximation algorithmic framework," Performance Evaluation, vol. 91, pp. 187-204, 2015. [9] H. Li, S. S. Bhowmick, J. Cui, Y. Gao, and J. Ma, "Getreal: Towards realistic selection of influence maximization strategies in competitive networks," in Proceedings of the 2015 ACM SIGMOD international conference on management of data. ACM,2015, pp. 1525-1537. [10] A. Tong, D.-Z. Du, and W. Wu, "On misinformation containment in online social networks," in Advances in Neural Information Processing Systems, 2018, pp. 339-349. [11] G. Tong, W. Wu, and D.-Z. Du, "Distributed rumor blocking with multiple positive cascades," IEEE Transactions on Computational Social Systems, vol. 5, no. 2, pp.468-480, 2018. [12] A. Das, S. Gollapudi, and K. Munagala, "Modeling opinion dynamics in social networks," in Proceedings of the 7th ACM international conference on Web search and data mining. ACM, 2014, pp. 403-412. [13] M. H. DeGroot, "Reaching a consensus," Journal of the American Statistical Association, vol. 69, no. 345, pp. 118-121, 1974. [14] R. Hegselmann, U. Krause et al., "Opinion dynamics and bounded condence models, analysis, and simulation," Journal of articial societies and social simulation,vol. 5, no. 3, 2002. [15] P. Cliord and A. Sudbury, "A model for spatial conflict," Biometrika, vol. 60, no. 3,pp. 581-588, 1973. [16] R. A. Holley, T. M. Liggett et al., "Ergodic theorems for weakly interacting innite systems and the voter model," The annals of probability, vol. 3, no. 4, pp. 643-663,1975. [17] A. V. Proskurnikov, A. S. Matveev, and M. Cao, "Opinion dynamics in social networks with hostile camps: Consensus vs. polarization," IEEE Transactions on Automatic Control, vol. 61, no. 6, pp. 1524-1536, 2016. [18] S. Dhamal, W. Ben-Ameur, T. Chahed, and E. Altman, "A two phase investment game for competitive opinion dynamics in social networks," arXiv preprint arXiv:1811.08291, 2018. [19] F. Morone and H. A. Makse, "Influence maximization in complex networks through optimal percolation," Nature, vol. 524, no. 7563, p. 65, 2015. [20] L. A. Adamic and N. Glance, "The political blogosphere and the 2004 us election:divided they blog," in Proceedings of the 3rd international workshop on Link discovery. ACM, 2005, pp. 36-43. [21] J. Yang and J. Leskovec, "Dening and evaluating network communities based on ground-truth," Knowledge and Information Systems, vol. 42, no. 1, pp. 181-213,2015. [22] H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, "Local higher-order graph clustering," in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2017, pp. 555-564. [23] J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graph evolution: Densication and shrinking diameters," ACM Transactions on Knowledge Discovery from Data (TKDD), vol. 1, no. 1, p. 2, 2007. [24] M. E. Newman, "Fast algorithm for detecting community structure in networks," Physical review E, vol. 69, no. 6, p. 066133, 2004. [25] L. Xiao, S. Boyd, and S.-J. Kim, "Distributed average consensus with least-meansquare deviation," Journal of parallel and distributed computing, vol. 67, no. 1, pp.33-46, 2007. [26] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE/ACM Transactions on Networking (TON), vol. 14, no. SI, pp. 2508-2530,2006. [27] S. Gold, A. Rangarajan et al., "Softmax to softassign: Neural network algorithms for combinatorial optimization," Journal of Articial Neural Networks, vol. 2, no. 4, pp. 381-399, 1996. [28] C. M. Bishop, Pattern recognition and machine learning. springer, 2006. [29] A. Goyal, F. Bonchi, and L. V. Lakshmanan, "Learning influence probabilities in social networks," in Proceedings of the third ACM international conference on Web search and data mining. ACM, 2010, pp. 241-250. [30] P.-L. Liao, C.-K. Chou, and M.-S. Chen, "Uncovering multiple diusion networks using the first-hand sharing pattern," in Proceedings of the 2016 SIAM International Conference on Data Mining. SIAM, 2016, pp. 63-71. [31] J. Reichardt and S. Bornholdt, "Statistical mechanics of community detection," Physical Review E, vol. 74, no. 1, p. 016110, 2006. [32] C.-S. Chang, C.-J. Chang, W.-T. Hsieh, D.-S. Lee, L.-H. Liou, and W. Liao, "Relative centrality and local community detection," Network Science, vol. 3, no. 4, pp.445-479, 2015. [33] C.-S. Chang, D.-S. Lee, L.-H. Liou, S.-M. Lu, and M.-H. Wu, "A probabilistic framework for structural analysis and community detection in directed networks," IEEE/ACM Transactions on Networking (TON), vol. 26, no. 1, pp. 31-46, 2018. [34] P. Erdos, "On random graphs," Publicationes mathematicae, vol. 6, pp. 290-297, 1959. [35] A. Saade, F. Krzakala, and L. Zdeborova, "Spectral clustering of graphs with the bethe hessian," in Advances in Neural Information Processing Systems, 2014, pp. 406-414. [36] L. A. Decelle, F. Krzakala, and P. Zhang, "Mode-net: Modules detection in networks,"2012. [37] N. P. Nguyen, G. Yan, M. T. Thai, and S. Eidenbenz, "Containment of misinformation spread in online social networks," in Proceedings of the 4th Annual ACM Web Science Conference. ACM, 2012, pp. 213-222. [38] M. Newman, Networks: an introduction. OUP Oxford, 2009. |