karab22

March 01, 2019

Edges:
Color = interaction type
Width = frequency of interaction
Lines = dashed is multiple interactions

Vertices:
Vertex size = Eigenvector centrality
Vertex opacity = closeness centrality
Vertex tooltip = betweenness centrality.

Directed Network

Tweet

The graph is directed.

The graph's vertices were grouped by cluster using the Girvan-Newman cluster algorithm.

The graph was laid out using the Fruchterman-Reingold layout algorithm.

The edge widths are based on frequency values. The vertex sizes are based on eigenvector centrality values. The vertex opacities are based on closeness centrality values.

Overall Graph Metrics:
Vertices: 8
Unique Edges: 18
Edges With Duplicates: 2
Total Edges: 20
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.727272727272727
Reciprocated Edge Ratio: 0.842105263157895
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 8
Maximum Edges in a Connected Component: 20
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.75
Graph Density: 0.339285714285714
Modularity: 0.21625
NodeXL Version: 1.0.1.409

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: (Add your own word list)
[0] Non-categorized Words
[0] Total Words