The graph is directed.
The graph was laid out using the Fruchterman-Reingold layout algorithm.
The vertex sizes are based on betweenness centrality values.
Overall Graph Metrics:
Unique Edges: 383
Edges With Duplicates: 0
Total Edges: 383
Connected Components: 13
Single-Vertex Connected Components: 10
Maximum Vertices in a Connected Component: 79
Maximum Edges in a Connected Component: 369
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.403259
Graph Density: 0.0377512856474988
Modularity: Not Applicable
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
This shows the clusters in our participants and remote particpants, with size set by betweenness centrality