20120413-Scott AND Walker- NodeXL-Twitter-No Follow Edges, 4/13/2012 2:32:43 PM, 545


FAQ | Problem?

20120413-Scott AND Walker- NodeXL-Twitter-No Follow Edges
20120413-Scott AND Walker- NodeXL-Twitter-No Follow Edges
From:
marc_smith
Uploaded on:
April 13, 2012
Description:
The graph represents a network of up to 1000 Twitter users whose recent tweets contained "scott AND walker". The network was obtained on Friday, 13 April 2012 at 07:40 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 earliest tweet in the network was tweeted on Thursday, 12 April 2012 at 03:32 UTC. The latest tweet in the network was tweeted on Friday, 13 April 2012 at 04:12 UTC.

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 Harel-Koren Fast Multiscale layout algorithm.

The edge colors are based on relationship values. The vertex sizes are based on followers values.

Overall Graph Metrics:
Vertices: 1000
Unique Edges: 9789
Edges With Duplicates: 958
Total Edges: 10747
Self-Loops: 714
Connected Components: 166
Single-Vertex Connected Components: 156
Maximum Vertices in a Connected Component: 814
Maximum Edges in a Connected Component: 10505
Maximum Geodesic Distance (Diameter): 8
Average Geodesic Distance: 2.912947
Graph Density: 0.00967067067067067
Modularity: 0.341382

Top 10 Vertices, Ranked by Betweenness Centrality:
huffingtonpost
thenation
edshow
usrealitycheck
huffpostpol
nicholsuprising
ezkool
spudlovr
thewiremagazine
truthteam2012