|
Online Social Networks
and Media |
Home |
Lecture 1: Introduction Introduction
to main problems about networks. Basic mathematic
concepts Material:
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: Strong and Weak ties Strong and
Weak ties. Strong Triadic Closure. Bridges. Material:
Lecture 5: Graph Partitioning, Homophily Centrality
and Betweeness, Graph
Partitioning, Spectral Clustering. Homophily in Social networks. Material:
Homophily in Social networks.
Graphs with positive and negative relationships. Material:
Web Search. Ranking the web using
links. Material:
Absorbing Random Walks. Applications
for label propagation, opinion formation models. Material:
Game
theoretic information cascade. Models for epidemic
spread. Selecting influencers to maximize spread. Material:
Using
content from online social networks and media to
predict stock changes, track earthquakes, and
understand news cycles. Material:
A model
for Milgram's experiment. Analysis of search
algorithms in small world networks. Material:
|