The graph represents a network of 29 Twitter users whose recent tweets contained "ht2012". The network was obtained on Monday, 25 June 2012 at 01:15 UTC. There is an edge for each follows relationship. 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 tweets were made over the 10-day period from Saturday, 16 June 2012 at 14:30 UTC to Monday, 25 June 2012 at 01:06 UTC.
The ACM Hypertext 2012 Conference is held in Milwaukee, Wisconsin June 25-28, 2012.
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. The vertex opacities are based on followers values.
Overall Graph Metrics:
Unique Edges: 84
Edges With Duplicates: 47
Total Edges: 131
Connected Components: 9
Single-Vertex Connected Components: 5
Maximum Vertices in a Connected Component: 17
Maximum Edges in a Connected Component: 107
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.684887
Graph Density: 0.102216748768473
NodeXL Version: 188.8.131.52
Top 10 Vertices, Ranked by Betweenness Centrality:
Top Replied-To, in Entire Graph
Top Mentioned, in Entire Graph
Top URLs in Tweet, in Entire Graphhttps://play.google.com/store/apps/details?id=hypertext2012.com#?t=W251bGwsMSwxLDIxMiwiaHlwZXJ0ZXh0MjAxMi5jb20iXQhttp://halley.exp.sis.pitt.edu/cn3/presentation2.php?conferenceID=86&presentationID=3492http://ht2012.orghttp://ht2012.org/workshops.xmlhttp://bit.ly/IATVRadiohttp://bit.ly/LtfVyZhttp://via.me/-23bfsxyhttp://www.ht2012.org
Top Hashtags in Tweet, in Entire Graph
Top Tweeters, in Entire Graph