The graph represents a network of 14,470 Twitter users whose recent tweets contained "Kaliningrad", or who were 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, 21 June 2022 at 19:56 UTC.
The tweets in the network were tweeted over the 8-hour, 50-minute period from Tuesday, 21 June 2022 at 10:09 UTC to Tuesday, 21 June 2022 at 18:59 UTC.
Additional tweets that were mentioned in this data set were also collected from prior time periods. These tweets may expand the complete time period of the data.
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 Fruchterman-Reingold layout algorithm.
Vertices : 14524
Unique Edges : 18788
Edges With Duplicates : 37429
Total Edges : 56217
Self-Loops : 13450
Reciprocated Vertex Pair Ratio : 0.0320409412026478
Reciprocated Edge Ratio : 0.0620923839810273
Connected Components : 1979
Single-Vertex Connected Components : 1441
Maximum Vertices in a Connected Component : 11355
Maximum Edges in a Connected Component : 41860
Maximum Geodesic Distance (Diameter) : 16
Average Geodesic Distance : 5.902395
Graph Density : 8.79572346833283E-05
Modularity : 0.317991
NodeXL Version : 1.0.1.449
Data Import : The graph represents a network of 14,470 Twitter users whose recent tweets contained "Kaliningrad", or who were 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, 21 June 2022 at 19:56 UTC.
The tweets in the network were tweeted over the 8-hour, 50-minute period from Tuesday, 21 June 2022 at 10:09 UTC to Tuesday, 21 June 2022 at 18:59 UTC.
Additional tweets that were mentioned in this data set were also collected from prior time periods. These tweets may expand the complete time period of the data.
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 Fruchterman-Reingold layout algorithm.
Graph Source : TwitterSearch
Graph Term : Kaliningrad
Groups : The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
Top Domains