Michael__Lieberman

January 22, 2019

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 widths are based on edge weight values. The vertex sizes are based on betweenness centrality values.

Overall Graph Metrics:
Vertices: 130
Unique Edges: 377
Edges With Duplicates: 0
Total Edges: 377
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.0895953757225433
Reciprocated Edge Ratio: 0.164456233421751
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 130
Maximum Edges in a Connected Component: 377
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.943669
Graph Density: 0.0224806201550388
Modularity: 0.323537
NodeXL Version: 1.0.1.408

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