lapland OR lappland or lappi_2020-01-25_03-31-45.xlsx
From:
Connected Action NodeXL-Reports
Uploaded on:
January 25, 2020
Description:
The graph represents a network of 0 Twitter users whose recent tweets contained "lapland OR lappland or lappi", 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 Saturday, 25 January 2020 at 11:31 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 : 0
Unique Edges : 0
Edges With Duplicates : 0
Total Edges : 0
Self-Loops : 0
Reciprocated Vertex Pair Ratio : Not Applicable
Reciprocated Edge Ratio : Not Applicable
Connected Components : 0
Single-Vertex Connected Components : 0
Maximum Vertices in a Connected Component : 0
Maximum Edges in a Connected Component : 0
Maximum Geodesic Distance (Diameter) : Not Applicable
Average Geodesic Distance : Not Applicable
Graph Density : Not Applicable
Modularity : Not Applicable
NodeXL Version : 1.0.1.423
Data Import : The graph represents a network of 0 Twitter users whose recent tweets contained "lapland OR lappland or lappi", 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 Saturday, 25 January 2020 at 11:31 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 : lapland OR lappland or lappi
Groups : The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
Top Domains