Centrality and Structure Detection. We consider eigenvalue centrality (sounds good mathematically but should be fully understood), and then Kleinberg's Hubs and Authorities method, opening up the happiness box containing matrixology. Onwards with structure detection. We briefly examine of agglomeration methods, and then into the massive amount of work on division methods. We outline a basic measure of modularity which we can use to gauge the performance of structure detection algorithms.

The biggest network of all: Galactic webs. And how people do not understand how people do not understand randomness. Seventeen.

Back of the envelope notes made during class.
Notes from office hours.

2016/04/07

1:17:03