Model friendships, webs and grids as graphs. Measure degrees of separation, rank pages the way search engines began, and find the weak points of a network.
3 units, about 3 hours. Free.
Represent a network as a graph and measure separation with breadth-first search.
2Implement PageRank by power iteration and explain the random surfer and the damping factor.
3Compare a network's resilience to random failure against targeted attack on its hubs.