20111003-NodeXL-Twitter-Orange graph
From: www.connectedaction.net
Link:
Connections among the Twitter users who recently tweeted the word #Orange 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: www.orange.com/
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: www.flickr.com/photos/marc_smith/6210089698/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:
Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 2282
Edges With Duplicates: 960
Total Edges: 3242
Self-Loops: 1170
Connected Components: 584
Single-Vertex Connected Components: 515
Maximum Vertices in a Connected Component: 155
Maximum Edges in a Connected Component: 1123
Maximum Geodesic Distance (Diameter): 8
Average Geodesic Distance: 2.787863
Graph Density: 0.001827828
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-Orange graph
From: www.connectedaction.net
Link:
Connections among the Twitter users who recently tweeted the word #Orange 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: www.orange.com/
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: www.flickr.com/photos/marc_smith/6210089698/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:
Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 2282
Edges With Duplicates: 960
Total Edges: 3242
Self-Loops: 1170
Connected Components: 584
Single-Vertex Connected Components: 515
Maximum Vertices in a Connected Component: 155
Maximum Edges in a Connected Component: 1123
Maximum Geodesic Distance (Diameter): 8
Average Geodesic Distance: 2.787863
Graph Density: 0.001827828
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.