|
Online Social Networks
and Media |
Home |
Lecture 1: Introduction Introduction
to main problems about networks. Basic mathematic
concepts Material:
Lecture
slides (pptx, pdf).
Lecture 2: Network Measurements Degree
distributions. Measuring power-laws. Clustering
Coefficient, Bow-tie structure, Homophily. Material:
Lecture 3: Network Models Erdos-Renyi
graphs. Configuration Model. Preferential Attachment.
Small-world models. Forrest-Fire model. Material:
Lecture 4: Graph Partitioning, Community Detection Communities
in Social Networks, Centrality and Betweeness, Graph
Partitioning. Material:
Lecture 5: Graph Partitioning, Densest Subgraph Graph
Partitioning, Spectral Clustering. The
Densest Subgraph problem. Material:
Lecture 6: Link Analysis
Ranking, Absorbing Random Walks. Web
search, PageRank, HITS. Random walks on
graphs. Absorbing Random Walks. Opinion diffusion. Material:
Lecture slides: (pptx, pdf) Lecture 7: Information Cascades, Epidemics, Influence Maximization Game
theoretic information cascade. Models for epidemic
spread. Selecting influencers to maximize spread. Material:
Lecture 8: Strong and Weak Ties, Structural Balance Strong
and Weak ties. Affiliation networks. Networks with
Positive and Negative ties. Structural Balance. Material:
Lecture 9: Link Prediction. Material:
Lecture 10: Recommendation
Systems. Material:
Lecture 11: Mining Social
Content. Using content from online social
networks and media to predict stock changes, track
earthquakes, and understand news cycles. Material:
|