|
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, Effective Diameter, Bow-tie structure, Homophily. Material:
Lecture 3: Network Models Erdos-Renyi
graphs. Configuration Model. Preferential Attachment.
Small-world models. Forrest-Fire model. Kronecker
graphs Material:
Lecture 4: Community Detection Communities in Social Networks, Clustering, Betweeness,Modularity Material:
Lecture 5: Graph Partitioning, Densest Subgraph Graph
Partitioning, Spectral Clustering. The
Densest Subgraph problem. Material:
Material:
Lecture slides: (pptx, pdf)
Lecture 7: 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 8: Recommendation
systems and Social Recommendations. Recommendation Systems and Social
Recommendations. Material:
Lecture 9: Link Prediction.
Material:
Lecture slides: (pptx, pdf) Lecture 10: Team formation in Social Networks. Network Ties Team
formation in Social Networks. Strong
and Weak ties. Strong Triadic Closure. Networks
with Positive and Negative ties. Structural
Balance. Material:
Lecture slides: (pptx, pdf) Lecture 11: Fairness and Diversity in Social Media Formal
models for fairness. Diversity in Social
Media. Material:
|