UPDATED #oer OR #ukoer on 25th July 2012
View an interactive version of this graph (experimental)
July 25, 2012
This is an updated version of the network by mhawksey found here:
The options file used to create this layout is linked from the bottom of this page and found here:
The graph is directed.
The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
The edge colors are based on relationship values. The vertex sizes are based on followers values. The vertex opacities are based on followers values.
Overall Graph Metrics:
Unique Edges: 493
Edges With Duplicates: 360
Total Edges: 853
Connected Components: 188
Single-Vertex Connected Components: 162
Maximum Vertices in a Connected Component: 225
Maximum Edges in a Connected Component: 489
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 4.146331
Graph Density: 0.00165806565547554
NodeXL Version: 188.8.131.52
Top 10 Vertices, Ranked by Betweenness Centrality:
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
Top Replied-To, in Entire Graph
Top Mentioned, in Entire Graph
Top URLs in Tweet, in Entire Graph
Top Hashtags in Tweet, in Entire Graph
Top Tweeters, in Entire Graph
Download the Graph Data as a NodeXL Workbook
Download the Graph Data as GraphML
Download the NodeXL Options Used to Create the Graph
How to Upload Your Own NodeXL Graphs