The Workshop on Information in Networks 2011 was held at NYU September 30-October 1st.
Over the course of the event a number of people tweeted using the hashtag #win2011.
[flickr id=”6209064926″ thumbnail=”medium” overlay=”true” size=”large” group=”” align=”none”]
These are the connections among the Twitter users who recently tweeted the word win2011 when queried on October 3, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.
See: winworkshop.net/
Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.
A larger version of the image is here:http://www.flickr.com/photos/marc_smith/6209064926/sizes/l/in/photostream/
Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality
Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111
Top most between users:
@sinanaral
@winworkshop
@barrywellman
@ladamic
@seanjtaylor
@drewconway
@chrisdiehl
@dylanwalker
@marc_smith
@ariegoldshlager
Graph Metric: Value
Graph Type: Directed
Vertices: 38
Unique Edges: 227
Edges With Duplicates: 193
Total Edges: 420
Self-Loops: 68
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 38
Maximum Edges in a Connected Component: 420
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.836565
Graph Density: 0.194167852
NodeXL Version: 1.0.1.179
[flickr id=”6198785387″ thumbnail=”medium” overlay=”true” size=”large” group=”” align=”none”]
These are the connections among the Twitter users who tweeted the word win2011 when queried a few days earlier on September 30, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.
A larger version of the image is here: www.flickr.com/photos/marc_smith/6198785387/sizes/l/in/ph…
Top most between users:
@sinanaral
@winworkshop
@ariegoldshlager
@drewconway
@chrisdiehl
@kateaanderson
@dylanwalker
@barrywellman
@kristinalerman
@pboothe
Graph Metric: Value
Graph Type: Directed
Vertices: 16
Unique Edges: 60
Edges With Duplicates: 45
Total Edges: 105
Self-Loops: 26
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 16
Maximum Edges in a Connected Component: 105
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.617188
Graph Density: 0.270833333
NodeXL Version: 1.0.1.179
More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/
NodeXL is free and open and available from www.codeplex.com/nodexl
NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.