292F: All About Networks

Possible topics include:

• Graph algorithms o Traversals

292F: All About Networks Fall 2017, TR 9-11, Phelps 2510

o Shortest paths o Spanning tree o Network flow o Matching

Spectral analysis
o Eigenvaluesandeigenvectors o Laplacian
o Conductance bounds

Cuts, partitions, and sparsifiers

Random walks

Metrics:

o Centrality

o Homophily

Power laws

Network models
o Erdos Renyi (ER) model

o Random networks with a given degree sequence o Network formation models
o Small world networks

Multi-layered networks

Network embedding

o Word2vec

Clustering and classification

Learning graphical models

Modeling dynamic networks