Office Hours: MW 2:00-3:00pm
Online
email: tiantian.Chen@utdallas.edu
Unit 1 Community
1.1 What is the Social Network?
1.2 Independent Cascade and Linear Threshold
1.3-1 Connection-based Community Detection
1.3-2 Madularity Maximization
1.3-3 Influence-based Community Detection
1.5 Heuristic and Approximation
1.6 Power Law Graphs
Reading (Optional, not required)
1. Guangmo Tong, Lei Cui, Weili Wu, Cong Liu, Ding-Zhu Du:
Terminal-set-enhanced community detection in social networks.
INFOCOM 2016: 1-9.
2. Paul Wagenseller III, Feng Wang, Weili Wu:
Size Matters: A Comparative Analysis of Community Detection Algorithms.
IEEE Trans. Comput. Social Systems 5(4): 951-960 (2018)
3. Yuqing Zhu, Deying Li, Wen Xu, Weili Wu, Lidan Fan, James Willson:
Mutual-Relationship-Based Community Partitioning for Social Networks.
IEEE Trans. Emerging Topics Comput. 2(4): 436-447 (2014)
Unit 2 Influence
2.1 Influence Maximization
2.2 BKS-Conjecture
2.3 General Threshold and Cascade
2.4 KKT-Conjecture
2.5 Complexity of Influence Spread
Reading (Optional, not required)
1. D. Kempe, J. Kleinberg, E. Tardos:
Maximizing the spread of influence through a social network,
KDD'2003, pp.137-146.
2. Shishir Bharathi, David Kempe, Mahyar Salek:
Competitive Influence Maximization in Social Networks,
WINE 2007: 306-311.
3. Zaixin Lu, Zhao Zhang, Weili Wu:
Solution of Bharathi-Kempe-Salek conjecture for influence maximization on
arborescence.
J. Comb. Optim. 33(2): 803-808 (2017)
Unit 3 Randomized Algorithm
3.1 Probablistic Inequality
3.2 Buffon's Needle
3.3 Monte Carlo Method
3.4 Reverse Influence Sampling
3.5 Martingle
3.6 Another Way?
Reading (Optional, not required)
1. Youze Tang, Xiaokui Xiao, Yanchi Shi:
Influence Maximization: Near-Optimal
Time Complexity Meets Pratical Efficiency,
SIGMOD'14, Snobird, UT, USA, 2014: 75-86.
2. Wenguo Yang, Jianmin Ma, Yi Li, Ruidong Yan, Jing Yuan, Weili Wu, Deying Li:
Marginal Gains to Maximize Content Spread in Social Networks.
IEEE Trans. Comput. Social Systems 6(3): 479-490 (2019)
3. Jianming Zhu, Smita Ghosh, Weili Wu:
Group Influence Maximization Problem in Social Networks.
IEEE Trans. Comput. Social Systems 6(6): 1156-1164 (2019)
Unit 4 Viral Marketing
4.1 Multi-products
4.2 Balanced Seed-Distribution
4.3 Continuous Greedy
4.4 Pipage Rounding
4.5a Revenue maximization
4.5b Revenue maximization
4.6 Budget minimization
Reading (Optional, not required)
1. Jianxiong Guo, Weili Wu:
A Novel Scene of Viral Marketing for Complementary Products.
IEEE Trans. Comput. Social Systems 6(4): 797-808 (2019)
2. Yuqing Zhu, Deying Li, Ruidong Yan, Weili Wu, Yuanjun Bi:
Maximizing the Influence and Profit in Social Networks.
IEEE Trans. Comput. Social Systems 4(3): 54-64 (2017)
3. Guangmo Tong, Weili Wu, Shaojie Tang, Ding-Zhu Du:
Adaptive Influence Maximization in Dynamic Social Networks.
IEEE/ACM Trans. Netw. 25(1): 112-125 (2017)
Unit 5 Nonsubmodular Optimization
5.1 Interaction-Aware Viral Marketing
5.2 Complementary Products
5.3 Multi-feature Product
5.4 DS Decomposition
5.5 Positive Influence
5.6 Parameterized Methods
Reading (Optional, not required)
1. Chuangen Gao, Hai Du, Weili Wu, Hua Wang:
Viral marketing of online game by DS decomposition in social networks.
Theor. Comput. Sci. 803: 10-21 (2020)
Unit 6 Nonconvex Relaxation
6.1 Sandwich Theorem
6.2 Modular-Modular Method
6.3 Primal-Dual Method
6.4 Global Approximation of Local Optimality
6.5 Nonconvex Relaxation
Reading (Optional, not required)
1. Weili Wu, Zhao Zhang, Ding-Zhu Du:
Set function optimizations
Journal of the Operations Research Society of China. (2019) 7: 183 - 193
2. Weili Wu, Zhao Zhang, Ding-Zhu Du:
Global Approximation of Local Optimality: Nonsubmodular Optimization.
J. Oper. Res. Soc. China} (2023).
https://doi.org/10.1007/s40305-023-00475-3
Unit 7 Rumor Blocking
5.1 Rumor Detection
5.2 Rumor Source Detection
5.3 Community-based Rumor Blocking
5.4 NonCooperative Rumor Blocking
Reading (Optional, not required)
1. Lidan Fan, Zaixin Lu, Weili Wu, Bhavani M. Thuraisingham, Huan Ma, Yuanjun Bi:
Least Cost Rumor Blocking in Social Networks.
ICDCS 2013: 540-549
2. Guangmo Amo Tong, Ding-Zhu Du, Weili Wu:
On Misinformation Containment in Online Social Networks.
NeurIPS 2018: 339-349
3. Guangmo Tong, Weili Wu, Ding-Zhu Du:
Distributed Rumor Blocking With Multiple Positive Cascades.
IEEE Trans. Comput. Social Systems 5(2): 468-480 (2018)
Unit 6 Set Function
6.1 Submodular Max
6.2 Submodular Min
6.3 Supermodular Degree
6.4 Data-dependent Approximation
6.5 DS Decomposition and Sandwich
Theorem
6.6 Global Approximation
Reading (Optional, not required)
1. Wei-Li Wu, Zhao Zhang, Ding-Zhu Du:
Set function optimizations
Journal of the Operations Research Society of China. (2019) 7: 183 - 193
2. Ruidong Yan, Yi Li, Weili Wu, Deying Li, Yongcai Wang:
Rumor Blocking through Online Link Deletion on Social Networks.
TKDD 13(2): 16:1-16:26 (2019)
3. Chuangen Gao, Hai Du, Weili Wu, Hua Wang:
Viral marketing of online game by DS decomposition in social networks.
Theor. Comput. Sci. 803: 10-21 (2020)
Appendix: Not selected old lectures
Classroom presence will be enforced. (not applicable now)
This is a letter from the Head of CS Department to all students:
"I want to welcome you to the Spring 2018 semester and wish you a very happy 2018. May
you
all make a 4.0 this semester. However, to reach that 4.0 you have to make sure that you
attend all your classes. So let me take this opportunity to remind you that the CS
Department observes rules for attendance that are strictly enforced: 3 consecutive
absences result in a 1 letter downgrade and 4 consecutive absences result in an F. It is
especially important that you do not miss classes at the beginning of the semester."