INFORMATION ON CS/SE 6301 (Spring'2019)
Theory of Social Computing
4:00-6:45pm Thur, CB3 1.304

Office Hours: Tuesday, 4:00-5:00 pm
in Room ECSS 3-611.

Teaching Assistants: Shuyang Gu

Office Hours: 9:00-11:59am
Room: ECSS 3.614
email: [email protected]


No textbook
Please read ppt and cited references


Syllabus .
SOSC Bicriterian-Approximation

Unit 1 Introduction

1.1 What is the Social Network?
1.2 Heuristic and Approximation

Unit 2 Influence

2.1 Influence Maximization
2.2 Independent Cascade and Linear Threshold
2.3 BKS-Conjecture
2.4 General Threshold and Cascade
2.5 KKT-Conjecture
2.6 Complexity of Influence Spread
2.7 Reverse Sampling

Unit 3 Marketing

3.1 Multi-products
3.* Complementary Product
3.2 Influence and Profit
3.* Discount Coupon: Nonmonotone Submodular Max
3.* Free Samples: Bicriterian Approximation
3.* Coupon Distribution: Adaptive Submodular
3.3 Positive Influence
3.4 Compective Influence

Unit 4 Rumor

4.1 Community-based Rumor Blocking
4.2 NonCooperative Rumor Blocking
4.3 Randomized Rumor Blocking

Unit 5 Set Function

5.1 Introduction
5.2 DS Decomposition
5.3 Sandwich Theorem
5.4 Data-dependent Approximation
5.5 Supermodular Degree
5.6 BP Functions

Appendix: Not selected topics

4.2 Independent System
5.3 Submodular Cover (I)
5.* Application: Positive Influence
5.4 Submodular Cover (II)
5.5 Monotone Submodular Max
5.6 Nonmonotone Submodular Max
5.* Application: Profit Max
5.7 Supermodular Degree
5.8 Data-dependent Approximation
5.9 DS Decomposition
Unit 5 Friending

5.1 Active Friending
5.2 Supermodular Max
5.3 Target Frieding
5.4 Supermodular Cover

Unit 5 Community Detection

5.1 Community Detection
5.2 Modularity Maximization
5.3 Influence-based Detection

Unit 6 Power Law Graphs

6.1 Madularity Maximizatiom
6.2 Positive-Influnce Target-Dominating
6.2 (detail proof)

Unit 6 Positive Influence

5.1 Seeds for Positive-Influence
5.2 Target Influence
5.3 Partial Influence
5.4 Weighted Seeds

Unit 7 Marketing (This unit will be organized later.)

Chapter 11 Other Topics

11.1 Influence and Profit
11.2 Seed Selection for Certain Profit 10.1 Max Influence Path
10.2 Active Friending
10.3 Metric Approximation

Homeworks, Examinations and Grade

There are four homework and 2 in-class exams.
Totally, 40 points for assignment; 60 points for two exams. Grades will be assigned according to the total points as follows: A >= 85 > B >= 70 >B->=60> C >=50.

Classroom presence will be enforced.

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."