U.S. Congressional Shared Hashtag Network

From:

libbyh

Uploaded on:

August 22, 2012

Description:

The graph is undirected.

The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.

The edge widths are based on edge weight values. The edge opacities are based on edge weight values. The vertex sizes are based on followers values.

Overall Graph Metrics:

Vertices: 371

Unique Edges: 46935

Edges With Duplicates: 0

Total Edges: 46935

Self-Loops: 0

Reciprocated Vertex Pair Ratio: Not Applicable

Reciprocated Edge Ratio: Not Applicable

Connected Components: 1

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 371

Maximum Edges in a Connected Component: 46935

Maximum Geodesic Distance (Diameter): 3

Average Geodesic Distance: 1.315291

Graph Density: 0.683834778174401

Modularity: 0.043386

NodeXL Version: 1.0.1.219

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 edge opacities are based on edge weight values. The vertex sizes are based on followers values.

Overall Graph Metrics:

Vertices: 371

Unique Edges: 46935

Edges With Duplicates: 0

Total Edges: 46935

Self-Loops: 0

Reciprocated Vertex Pair Ratio: Not Applicable

Reciprocated Edge Ratio: Not Applicable

Connected Components: 1

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 371

Maximum Edges in a Connected Component: 46935

Maximum Geodesic Distance (Diameter): 3

Average Geodesic Distance: 1.315291

Graph Density: 0.683834778174401

Modularity: 0.043386

NodeXL Version: 1.0.1.219

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