Layout Algorithm : The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm. There is an edge for each "replies-to" relationship in a tweet, an edge for each "mentions" relationship in a tweet, and a self-loop edge for each tweet that is not a "replies-to" or "mentions". These tweets may expand the complete time period of the data. Additional tweets that were mentioned in this data set were also collected from prior time periods. The tweets in the network were tweeted over the 13-day, 22-hour, 49-minute period from Tuesday, 03 August 2021 at 00:34 UTC to Monday, 16 August 2021 at 23:23 UTC. The maximum number of tweets collected was 7,500. The requested start date was Tuesday, 17 August 2021 at 00:01 UTC and the maximum number of days (going backward) was 14. The network was obtained from the NodeXL Graph Server on Friday, 20 August 2021 at 15:00 UTC. Vertices : 550 Unique Edges : 528 Edges With Duplicates : 1695 Total Edges : 2223 Number of Edge Types : 5 Replies to : 51 Mentions : 1237 MentionsInRetweet : 618 Tweet : 103 Retweet : 214 Self-Loops : 123 Reciprocated Vertex Pair Ratio : 0.079646017699115 Reciprocated Edge Ratio : 0.147540983606557 Connected Components : 28 Single-Vertex Connected Components : 17 Maximum Vertices in a Connected Component : 502 Maximum Edges in a Connected Component : 2157 Maximum Geodesic Distance (Diameter) : 6 Average Geodesic Distance : 3.069908 Graph Density : 0.00282828282828283 Modularity : 0.298149 NodeXL Version : 1.0.1.445 Data Import : The graph represents a network of 550 Twitter users whose tweets in the requested range contained "techsoup", or who were replied to or mentioned in those tweets. The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm. The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm. The graph represents a network of 550 Twitter users whose tweets in the requested range contained "techsoup", or who were replied to or mentioned in those tweets.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |