The graph represents a network of 4 Twitter users whose tweets in the requested range contained "graphconnect", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Tuesday, 26 October 2021 at 00:20 UTC.
The requested start date was Tuesday, 26 October 2021 at 00:01 UTC and the maximum number of days (going backward) was 14.
The maximum number of tweets collected was 7,500.
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 : 4
Unique Edges : 4
Edges With Duplicates : 2
Total Edges : 6
Number of Edge Types : 3
MentionsInRetweet : 3
Mentions : 2
Retweet : 1
Self-Loops : 0
Reciprocated Vertex Pair Ratio : 0
Reciprocated Edge Ratio : 0
Connected Components : 1
Single-Vertex Connected Components : 0
Maximum Vertices in a Connected Component : 4
Maximum Edges in a Connected Component : 6
Maximum Geodesic Distance (Diameter) : 2
Average Geodesic Distance : 0.875
Graph Density : 0.416666666666667
Modularity : 0.138889
NodeXL Version : 1.0.1.447
Data Import : The graph represents a network of 4 Twitter users whose tweets in the requested range contained "graphconnect", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Tuesday, 26 October 2021 at 00:20 UTC.
The requested start date was Tuesday, 26 October 2021 at 00:01 UTC and the maximum number of days (going backward) was 14.
The maximum number of tweets collected was 7,500.
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 : graphconnect
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 : Betweenness Centrality
Top Domains
Top Word Pairs in Tweet in Entire Graph:
[2] 21style,awarded [2] awarded,graphconnect [2] graphconnect,thanks [2] thanks,neo4j [2] neo4j,guys [2] guys,#graphdb [2] #graphdb,museotorino Top Word Pairs in Tweet in G1:
[2] 21style,awarded [2] awarded,graphconnect [2] graphconnect,thanks [2] thanks,neo4j [2] neo4j,guys [2] guys,#graphdb [2] #graphdb,museotorino Top Replied-To in Entire Graph:
Top Replied-To in G1:
Top Mentioned in Entire Graph:
Top Mentioned in G1:
Top Tweeters in Entire Graph:
Top Tweeters in G1: