SG by mentions, 12/12/2019 7:20:08 PM, 218761


FAQ | Problem?

SG by mentions
SG by mentions
From:
Sara Savatovic
Uploaded on:
December 12, 2019
Description:
The graph was imported from the GraphML file "F:\ksu1234.graphml".

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.

The edge colors are based on edge weight values. The edge widths are based on edge weight values. The edge opacities are based on edge weight values.

Overall Graph Metrics:
Vertices: 500
Unique Edges: 761
Edges With Duplicates: 0
Total Edges: 761
Self-Loops: 3
Reciprocated Vertex Pair Ratio: 0.00397350993377483
Reciprocated Edge Ratio: 0.0079155672823219
Connected Components: 47
Single-Vertex Connected Components: 35
Maximum Vertices in a Connected Component: 434
Maximum Edges in a Connected Component: 739
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.198596
Graph Density: 0.00303807615230461
Modularity: 0.333715
NodeXL Version: 1.0.1.422

Top 10 Vertices, Ranked by Betweenness Centrality:
1
206
865
83
160
538
84
137
1104
777

Top Words in Tweet in Entire Graph:
[0] Words in Sentiment List#1: Positive
[0] Words in Sentiment List#2: Negative
[0] Words in Sentiment List#3: Angry/Violent
[0] Non-categorized Words
[0] Total Words

We use necessary cookies to make our site work. We’d like to set additional cookies to understand site usage, make site improvements and to remember your settings. We also use cookies set by other sites to help deliver content from their services.