Facebook Network Analysis
Using GetNet and graph visualization software Gephi, I created an undirected graph of my Facebook network (451 friends). Based on modularity, I measured the strength of division of the network into modules (also called groups, clusters or communities). Networks with high modularity have dense connections between the nodes within modules but sparse connections between nodes in different modules.
The modularity of my Facebook network = .728, revealing several major dense communities. Next, I colored each of the distinct communities and used the Fruchterman Reingold layout algorithm to display in a compact fashion. Then labeled the six largest communities. One can see a a core set of clusters at the top of the graph for Portland, San Francisco, and Family, illustrating a distinct gap from communities at the bottom of the graph. It's interesting to note the density of my Thunderbird community.