The graph represents a network of 1 Twitter user whose recent tweets contained "vitruvian partners", or who was replied to or mentioned in those tweets, taken from a data set limited to a maximum of 18,000 tweets. The network was obtained from Twitter on Tuesday, 22 June 2021 at 15:19 UTC.
The tweets in the network were tweeted over the 0-minute period from Thursday, 17 June 2021 at 16:36 UTC to Thursday, 17 June 2021 at 16:36 UTC.
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 : 1
Unique Edges : 1
Edges With Duplicates : 0
Total Edges : 1
Number of Edge Types : 1
Tweet : 1
Self-Loops : 1
Reciprocated Vertex Pair Ratio : Not Applicable
Reciprocated Edge Ratio : Not Applicable
Connected Components : 1
Single-Vertex Connected Components : 1
Maximum Vertices in a Connected Component : 1
Maximum Edges in a Connected Component : 1
Maximum Geodesic Distance (Diameter) : 0
Average Geodesic Distance : 0
Graph Density : Not Applicable
Modularity : 0.25
NodeXL Version : 1.0.1.445
Data Import : The graph represents a network of 1 Twitter user whose recent tweets contained "vitruvian partners", or who was replied to or mentioned in those tweets, taken from a data set limited to a maximum of 18,000 tweets. The network was obtained from Twitter on Tuesday, 22 June 2021 at 15:19 UTC.
The tweets in the network were tweeted over the 0-minute period from Thursday, 17 June 2021 at 16:36 UTC to Thursday, 17 June 2021 at 16:36 UTC.
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 : TwitterSearch
Graph Term : vitruvian partners
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 Tweeters in Entire Graph:
Top Tweeters in G1: