NodeXL Graph Gallery
/Pages/Default.aspx
These are network graphs created with NodeXL, an open-source template for graphing network data in Excel 2007 and 2010.en-us10/Images/SiteLogo.pngNodeXL Graph Gallery
/Pages/Default.aspx
2014-04-23 08-40-21 NodeXL.xlsx
/Pages/Graph.aspx?graphID=18869
<a href="/Pages/Graph.aspx?graphID=18869"><img src="/Images/Image.ashx?graphID=18869&type=t" /></a><p>The graph represents the UserPostLikes, UserPostComments, network of the "116328955649" Facebook fan page. The network was obtained on Wednesday, 23 April 2014 at 15:39 UTC. The first 20 wall posts of the fan page are analyzed. There is an edge between the user that has commented and the post in which he has commented. There is an edge between the user that has liked and the post which he has liked. For each user, 8000 characters of his wall posts are downloaded. For each user, 8000 characters of his status updates are downloaded. URLs, Hashtags and user tags are extracted from the downloaded wall posts/status updates. The earliest post in the network was posted on Friday, 21 Feb...</p>marc_smithWed, 23 Apr 2014 15:44:49 GMTGraph of social network January.xlsx
/Pages/Graph.aspx?graphID=18868
<a href="/Pages/Graph.aspx?graphID=18868"><img src="/Images/Image.ashx?graphID=18868&type=t" /></a><p>The graph is undirected.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Random layout algorithm.
The vertex colors are based on clustering coefficient values. The vertex sizes are based on betweenness centrality values.
Overall Graph Metrics:
Vertices: 63
Unique Edges: 61
Edges With Duplicates: 256
Total Edges: 317
Self-Loops: 195
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 12
Single-Vertex Connected Components: 10
Maximum Vertices in a Connected Component: 51
Maximum Edges in a Connected Component: 304
Maximum Geodesic ...</p>GuestWed, 23 Apr 2014 15:40:51 GMT2014-04-23 08-40-21 NodeXL.xlsx
/Pages/Graph.aspx?graphID=18867
<a href="/Pages/Graph.aspx?graphID=18867"><img src="/Images/Image.ashx?graphID=18867&type=t" /></a><p>The graph represents the UserPostLikes, UserPostComments, network of the "116328955649" Facebook fan page. The network was obtained on Wednesday, 23 April 2014 at 15:39 UTC. The first 20 wall posts of the fan page are analyzed. There is an edge between the user that has commented and the post in which he has commented. There is an edge between the user that has liked and the post which he has liked. For each user, 8000 characters of his wall posts are downloaded. For each user, 8000 characters of his status updates are downloaded. URLs, Hashtags and user tags are extracted from the downloaded wall posts/status updates. The earliest post in the network was posted on Friday, 21 Feb...</p>marc_smithWed, 23 Apr 2014 15:40:42 GMTTwitterusernetworkaroundHishamuddinH2Onetwork2deg1000personslimit.xlsx
/Pages/Graph.aspx?graphID=18866
<a href="/Pages/Graph.aspx?graphID=18866"><img src="/Images/Image.ashx?graphID=18866&type=t" /></a><p>The graph is directed.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Circle layout algorithm.
Overall Graph Metrics:
Vertices: 20577
Unique Edges: 23648
Edges With Duplicates: 93266
Total Edges: 116914
Self-Loops: 32667
Reciprocated Vertex Pair Ratio: 0.0123055887882413
Reciprocated Edge Ratio: 0.0243120040520007
Connected Components: 452
Single-Vertex Connected Components: 376
Maximum Vertices in a Connected Component: 19732
Maximum Edges in a Connected Component: 113760
Maximum Geodesic Distance (Diameter): 12
Average Geodesic Distance: 4.800178
Graph Density: 8.39363295820705E-05
M...</p>SHJWed, 23 Apr 2014 15:07:04 GMThttp://www.nytimes.com/2014/04/23/us/politics/amid-politics-obama-drifted-away-from-kin.html Twitter
/Pages/Graph.aspx?graphID=18865
<a href="/Pages/Graph.aspx?graphID=18865"><img src="/Images/Image.ashx?graphID=18865&type=t" /></a><p>The graph represents a network of 102 Twitter users whose recent tweets contained "http://www.nytimes.com/2014/04/23/us/politics/amid-politics-obama-drifted-away-from-kin.html", or who were replied to or mentioned in those tweets, taken from a data set limited to a maximum of 18,000 tweets. The network was obtained from Twitter on Wednesday, 23 April 2014 at 14:54 UTC.
The tweets in the network were tweeted over the 2-hour, 59-minute period from Wednesday, 23 April 2014 at 11:48 UTC to Wednesday, 23 April 2014 at 14:47 UTC.
There is an edge for each "replies-to" relationship in a tweet. There is an edge for each "mentions" relationship in a tweet. There is a self-loop edge for ea...</p>marc_smithWed, 23 Apr 2014 14:55:29 GMToled Twitter NodeXL SNA Map and Report for Wednesday, 23 April 2014 at 14:22 UTC
/Pages/Graph.aspx?graphID=18864
<a href="/Pages/Graph.aspx?graphID=18864"><img src="/Images/Image.ashx?graphID=18864&type=t" /></a><p>The graph represents a network of 1,450 Twitter users whose recent tweets contained "oled", or who were replied to or mentioned in those tweets, taken from a data set limited to a maximum of 18,000 tweets. The network was obtained from Twitter on Wednesday, 23 April 2014 at 14:27 UTC.
The tweets in the network were tweeted over the 1-day, 18-hour, 17-minute period from Monday, 21 April 2014 at 20:03 UTC to Wednesday, 23 April 2014 at 14:20 UTC.
There is an edge for each "replies-to" relationship in a tweet. There is an edge for each "mentions" relationship in a tweet. There is a self-loop edge for each tweet that is not a "replies-to" or "mentions".
The graph is directed.
T...</p>marc_smithWed, 23 Apr 2014 14:33:36 GMTPhilipsLight Twitter NodeXL SNA Map and Report for Wednesday, 23 April 2014 at 14:21 UTC
/Pages/Graph.aspx?graphID=18863
<a href="/Pages/Graph.aspx?graphID=18863"><img src="/Images/Image.ashx?graphID=18863&type=t" /></a><p>The graph represents a network of 294 Twitter users whose recent tweets contained "PhilipsLight", or who were replied to or mentioned in those tweets, taken from a data set limited to a maximum of 18,000 tweets. The network was obtained from Twitter on Wednesday, 23 April 2014 at 14:22 UTC.
The tweets in the network were tweeted over the 7-day, 20-hour, 14-minute period from Tuesday, 15 April 2014 at 18:05 UTC to Wednesday, 23 April 2014 at 14:20 UTC.
There is an edge for each "replies-to" relationship in a tweet. There is an edge for each "mentions" relationship in a tweet. There is a self-loop edge for each tweet that is not a "replies-to" or "mentions".
The graph is directe...</p>marc_smithWed, 23 Apr 2014 14:25:20 GMT2014-04-23 20-32-15 NodeXL.xlsx
/Pages/Graph.aspx?graphID=18862
<a href="/Pages/Graph.aspx?graphID=18862"><img src="/Images/Image.ashx?graphID=18862&type=t" /></a><p>The graph is directed.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Fruchterman-Reingold layout algorithm.
Overall Graph Metrics:
Vertices: 148
Unique Edges: 108
Edges With Duplicates: 2
Total Edges: 110
Self-Loops: 13
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 54
Single-Vertex Connected Components: 13
Maximum Vertices in a Connected Component: 24
Maximum Edges in a Connected Component: 24
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 1.987805
Graph Density: 0.00441257584114727
Modularity: 0.875227
NodeXL Version: 1.0.1.322</p>GuestWed, 23 Apr 2014 11:32:20 GMT2014-04-23 12-13-05 NodeXL.xlsx
/Pages/Graph.aspx?graphID=18861
<a href="/Pages/Graph.aspx?graphID=18861"><img src="/Images/Image.ashx?graphID=18861&type=t" /></a><p>The graph is directed.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Fruchterman-Reingold layout algorithm.
Overall Graph Metrics:
Vertices: 1762
Unique Edges: 1753
Edges With Duplicates: 97
Total Edges: 1850
Self-Loops: 20
Reciprocated Vertex Pair Ratio: 0.00965360590573538
Reciprocated Edge Ratio: 0.0191226096737908
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 1762
Maximum Edges in a Connected Component: 1850
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.99773
Graph Density: 0.000573015667369884
Modul...</p>GuestWed, 23 Apr 2014 11:13:19 GMT#gaphashtagsearchonTwitterunlimited.xlsx
/Pages/Graph.aspx?graphID=18860
<a href="/Pages/Graph.aspx?graphID=18860"><img src="/Images/Image.ashx?graphID=18860&type=t" /></a><p>The graph is directed.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Sugiyama layout algorithm.
Overall Graph Metrics:
Vertices: 231
Unique Edges: 9
Edges With Duplicates: 0
Total Edges: 9
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 222
Single-Vertex Connected Components: 216
Maximum Vertices in a Connected Component: 4
Maximum Edges in a Connected Component: 3
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 0.829268
Graph Density: 0.000169395821569735
Modularity: Not Applicable
NodeXL Version: 1.0.1.322
Top T...</p>SHJWed, 23 Apr 2014 10:49:52 GMTNodeXLGraph3 NCE 2013.xlsx
/Pages/Graph.aspx?graphID=18859
<a href="/Pages/Graph.aspx?graphID=18859"><img src="/Images/Image.ashx?graphID=18859&type=t" /></a><p>The graph is undirected.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
The vertex sizes are based on degree values.
Overall Graph Metrics:
Vertices: 51
Unique Edges: 180
Edges With Duplicates: 90
Total Edges: 270
Self-Loops: 2
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 51
Maximum Edges in a Connected Component: 270
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1,799308
G...</p>GuestWed, 23 Apr 2014 10:22:59 GMTNodeXLGraph3 NCE 2013.xlsx
/Pages/Graph.aspx?graphID=18858
<a href="/Pages/Graph.aspx?graphID=18858"><img src="/Images/Image.ashx?graphID=18858&type=t" /></a><p>The graph is undirected.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
The vertex sizes are based on degree values.
Overall Graph Metrics:
Vertices: 51
Unique Edges: 180
Edges With Duplicates: 90
Total Edges: 270
Self-Loops: 2
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 51
Maximum Edges in a Connected Component: 270
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1,799308
G...</p>GuestWed, 23 Apr 2014 10:19:01 GMTmynypd Twitter NodeXL SNA Map and Report for Wednesday, 23 April 2014 at 06:21 UTC
/Pages/Graph.aspx?graphID=18857
<a href="/Pages/Graph.aspx?graphID=18857"><img src="/Images/Image.ashx?graphID=18857&type=t" /></a><p>The graph represents a network of 509 Twitter users whose recent tweets contained "mynypd", or who were replied to or mentioned in those tweets, taken from a data set limited to a maximum of 18,000 tweets. The network was obtained from Twitter on Wednesday, 23 April 2014 at 06:22 UTC.
The tweets in the network were tweeted over the 9-minute period from Wednesday, 23 April 2014 at 06:12 UTC to Wednesday, 23 April 2014 at 06:21 UTC.
There is an edge for each "replies-to" relationship in a tweet. There is an edge for each "mentions" relationship in a tweet. There is a self-loop edge for each tweet that is not a "replies-to" or "mentions".
The graph is directed.
The graph's ver...</p>marc_smithWed, 23 Apr 2014 06:23:53 GMT2014-04-22 23-19-44 NodeXL.xlsx
/Pages/Graph.aspx?graphID=18856
<a href="/Pages/Graph.aspx?graphID=18856"><img src="/Images/Image.ashx?graphID=18856&type=t" /></a><p>The graph is undirected.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Spiral layout algorithm.
Overall Graph Metrics:
Vertices: 0
Unique Edges: 0
Edges With Duplicates: 0
Total Edges: 0
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 0
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 0
Maximum Edges in a Connected Component: 0
Maximum Geodesic Distance (Diameter): Not Applicable
Average Geodesic Distance: Not Applicable
Graph Density: Not Applicable
Modularity: Not Applicable
N...</p>GuestWed, 23 Apr 2014 04:20:00 GMT