OmahaGives Twitter NodeXL SNA Map and Report for Wednesday, 21 September 2022 at 19:15 UTC (experimental version)
NOTE: This version of the graph is not available with the browser you are using. A
more recent version of the browser is required.
Go to the graph's main page
Uploaded on:
September 21, 2022
Description:
The graph represents a network of 2 Twitter users whose tweets in the requested range contained "OmahaGives", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Wednesday, 21 September 2022 at 19:16 UTC.
The requested start date was Wednesday, 21 September 2022 at 14:15 UTC and the maximum number of tweets (going backward in time) was 10,000.
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".
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.
Author Description
Vertices : 2
Unique Edges : 1
Edges With Duplicates : 2
Total Edges : 3
Number of Edge Types : 3
Retweet : 1
MentionsInRetweet : 1
Tweet : 1
Self-Loops : 1
Reciprocated Vertex Pair Ratio : 0
Reciprocated Edge Ratio : 0
Connected Components : 1
Single-Vertex Connected Components : 0
Maximum Vertices in a Connected Component : 2
Maximum Edges in a Connected Component : 3
Maximum Geodesic Distance (Diameter) : 1
Average Geodesic Distance : 0.5
Graph Density : 0.5
Modularity : 0.25
NodeXL Version : 1.0.1.504
Data Import : The graph represents a network of 2 Twitter users whose tweets in the requested range contained "OmahaGives", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Wednesday, 21 September 2022 at 19:16 UTC.
The requested start date was Wednesday, 21 September 2022 at 14:15 UTC and the maximum number of tweets (going backward in time) was 10,000.
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".
Layout Algorithm : The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
Graph Source : GraphServerTwitterSearch
Graph Term : OmahaGives
Groups : The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
Edge Color : Edge Weight
Edge Width : Edge Weight
Edge Alpha : Edge Weight
Vertex Radius : In-Degree
Top Domains
Top Word Pairs in Tweet in Entire Graph:
[2] amazing,maze [2] maze,zing [2] zing,letâ [2] letâ,raise [2] raise,000 [2] 000,#omahagives Top Word Pairs in Tweet in G1:
[2] amazing,maze [2] maze,zing [2] zing,letâ [2] letâ,raise [2] raise,000 [2] 000,#omahagives Top Mentioned in Entire Graph:
Top Mentioned in G1:
Top Tweeters in Entire Graph:
Top Tweeters in G1: