Topics and materials -- Social and technological networks
Topic 0 : Background
The background concepts used in this course are quite general. You will find many resources online to look up. You are free to use your favourite books. Wikipedia is a good source for specific definitions. The course assumes that you know the following conecpts. Make sure that you understand them..
Graph theory
Background Concepts:
- Graphs
- Bipartite graphs
- Walks and Paths
- Breadth first search and Depth First search
- Connected components
- Shortest paths and Dijkstra's algorithm
- Spanning trees and minimum spanning trees. Kruskal's algorithm.
- Planar graphs
- Graph coloring. Four color theorem (not the proof, only the theorem statement.)
- Directed graphs and strongly connected components
There is of course wikipedia. There are many other sources, for example:
Asymptotic notations
Concepts
Sources: Wikipedia. Also, Page 43-48 in this book.
Probablity
- Basic probability
- Expectations
- Union bound
Sources: Wikipedia.
Background problems
Topic 1: Introduction
Topic 2 : Cascades
Topic 3 : Influence maximization
Topic 4 : Strong and weak ties, betweenness, homophily
Topic 5: Random Graphs
Topic 6: Web graphs and Ranking pages
Topic 7: Distances, metrics and network constructions
Topic 8: Community detection and clustering
- Slides
- Reading
- Additional (optional) reading
Topic 9: Spectral graph theory
Topic 10: Network embedding
Topic 11: Graph kernels and kernel methods
Topic 12: Power law networks
Topic 13: Small world networks
Topic 14: Classification
Topic 15 : Epidemics and gossip
- Slides
- Reading
- Additional (optional) reading
Topic 16: Edge prediction and Miscellaneous topics