20111003-NodeXL-Twitter-#win2011 top between
From: www.connectedaction.net
Link: www.flickr.com/photos/marc_smith/6209064926
Top most between Twitter users who recently tweeted the word win2011 when queried on October 3, 2011, sorted by betweenness centrality.
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 network visualization of the data here: www.flickr.com/photos/marc_smith/6209064926/sizes/l/in/ph...
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
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.
The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.
Marc Smith on Twitter.
20111003-NodeXL-Twitter-#win2011 top between
From: www.connectedaction.net
Link: www.flickr.com/photos/marc_smith/6209064926
Top most between Twitter users who recently tweeted the word win2011 when queried on October 3, 2011, sorted by betweenness centrality.
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 network visualization of the data here: www.flickr.com/photos/marc_smith/6209064926/sizes/l/in/ph...
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
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.
The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.
Marc Smith on Twitter.