|
|
Computer Science, Spring 2008 CS249B “Science of Networks” Lecture Notes |
- Lecture 01 :Introduction
and overview (01/28/08)
- Lecture 02 :Some Graph
Theory (01/31/08)
- Lecture 03 :Probability
for Networks: PMF, PDF,
CDF (02/04/08)
- Lecture 04 :Probability for Networks: Power
laws, log-log plots (02/07/08)
- Lecture 05 :Scale
Free, Pareto, Zipf (02/11/08) handout: Concept Maps
- Lecture 06: Small Worlds - Milgram, Dodds (02/21/08)
- Lecture 07: Small Worlds - Watt's alpha, beta model (02/25/08)
- Lecture 08: Small Worlds - Erdos-Reniy, Watts-Strogatz (02/28/08)
- Lecture 09: More Watts-Strogatz (03/03/08)
- Lecture 10: Game Theory (03/06/08)
- Lecture 11: Grokking the Marvel Universe (03/10/08)
- Lecture 12: Mapping the WWW - Crawlers, BFS (03/13/08)
- Lecture 13: Mapping the WWW - Broder's Bowtie (03/17/08) handout: Project Proposal
- Lecture 14: Barabasi-Albert's Scale-Free Network model (03/20/08)
- Lecture 15: More on BA and Pennock models (03/31/08)
- Lecture 16: Error and Attack Tolerance of SF networks (04/03/08)
- Lecture 17: Hierarchical Networks (04/07/08)
- Lecture 18: HOT models - Intro to Linear Programming (04/10/08)
- Lecture 19: HOT models - Robust Yet Fragile Internet (04/14/08)
- Lecture 20: Doyle's paper structure and arguments (04/17/08)
- Lecture 21: Doyle's setup and evidence (04/22/08)
- Lecture 22: Computing shortest paths in a network (04/24/08)
- Lecture 23: Finding shortest paths - Kleinberg, Dodds-Watts (04/28/08)
- Lecture 24: Webspam guest lecture by Takis Metaxas (05/01/08)
- Lecture 25: Class presentations, Epilogue (05/05/08)
back to CS
249B homepage