Tweet
window.twttr = (function (d, s, id) { var js, fjs = d.getElementsByTagName(s)[0], t = window.twttr || {}; if (d.getElementById(id)) return; js = d.createElement(s); js.id = id; js.src = "https://platform.twitter.com/widgets.js"; fjs.parentNode.insertBefore(js, fjs); t._e = []; t.ready = function (f) { t._e.push(f); }; return t; } (document, "script", "twitter-wjs"));

Graph of threaded Twitter conversations made during #moocmooc

From:

mhawksey

Uploaded on:

August 24, 2012

Description:

The graph is directed.

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

Overall Graph Metrics:

Vertices: 4018

Unique Edges: 2949

Edges With Duplicates: 70

Total Edges: 3019

Self-Loops: 0

Connected Components: 1034

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 60

Maximum Edges in a Connected Component: 76

Maximum Geodesic Distance (Diameter): 18

Average Geodesic Distance: 3.908277

Graph Density: 0.000184878774912942

Modularity: 0.985204

NodeXL Version: 1.0.1.218

Top 10 Vertices, Ranked by Out-Degree:

2.36143824475394E+17

2.36143557138841E+17

2.36143507113385E+17

2.36144056252641E+17

2.36143996601262E+17

2.36143853529346E+17

2.36143376632782E+17

2.36142981869101E+17

2.36142262134915E+17

2.36142072980176E+17

Top 10 Vertices, Ranked by Out-Degree:

2.36143824475394E+17

2.36143557138841E+17

2.36143507113385E+17

2.36144056252641E+17

2.36143996601262E+17

2.36143853529346E+17

2.36143376632782E+17

2.36142981869101E+17

2.36142262134915E+17

2.36142072980176E+17

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

The graph is directed.

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

The edge colors are based on relationship values. The vertex sizes are based on followers values.

Overall Graph Metrics:

Vertices: 452

Unique Edges: 493

Edges With Duplicates: 360

Total Edges: 853

Self-Loops: 466

Connected Components: 188

Single-Vertex Connected Components: 162

Maximum Vertices in a Connected Component: 225

Maximum Edges in a Connected Component: 489

Maximum Geodesic Distance (Diameter): 11

Average Geodesic Distance: 4.146331

Graph Density: 0.00165806565547554

The graph is directed.

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

Overall Graph Metrics:

Vertices: 4004

Unique Edges: 2944

Edges With Duplicates: 70

Total Edges: 3014

Self-Loops: 0

Connected Components: 1025

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 60

Maximum Edges in a Connected Component: 76

Maximum Geodesic Distance (Diameter): 18

Average Geodesic Distance: 3.910965

Graph Density: 0.000185862101925055

Modularity: Not Applicable

NodeXL Version: 1.0.1.218

Top 10 Vertices, Ranked by Degree:

2.36302620996804E+17

2.36642708146499E+17

2.35564762757484E+17

2.34782349328531E+17

2.35863953027248E+17

2.35576309596692E+17

2.3629590450262E+17

2.3629651822159E+17

2.36595421282201E+17

2.36405167438831E+17

Top 10 Vertices, Ranked by In-Degree:

2.36302620996804E+17

2.36642708146499E+17

2.35564762757484E+17

2.35566145288163E+17

2.35576309596692E+17

2.35863953027248E+17

2.34782349328531E+17

2.36405167438831E+17

2.3629590450262E+17

2.35748491266244E+17

Top 10 Vertices, Ranked by Out-Degree:

2.36143376632782E+17

2.36143271187972E+17

2.36143200996306E+17

2.36143824475394E+17

2.36143557138841E+17

2.36143507113385E+17

2.36143058947829E+17

2.36141730930491E+17

2.36141630481108E+17

2.36141569701474E+17

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

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.

Overall Graph Metrics:

Vertices: 4018

Unique Edges: 2949

Edges With Duplicates: 70

Total Edges: 3019

Self-Loops: 0

Connected Components: 1034

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 60

Maximum Edges in a Connected Component: 76

Maximum Geodesic Distance (Diameter): 18

Average Geodesic Distance: 3.908277

Graph Density: 0.000184878774912942

Modularity: 0.985204

NodeXL Version: 1.0.1.218

Top 10 Vertices, Ranked by Out-Degree:

2.36143824475394E+17

2.36143557138841E+17

2.36143507113385E+17

2.36144056252641E+17

2.36143996601262E+17

2.36143853529346E+17

2.36143376632782E+17

2.36142981869101E+17

2.36142262134915E+17

2.36142072980176E+17

Top 10 Vertices, Ranked by Out-Degree:

2.36143824475394E+17

2.36143557138841E+17

2.36143507113385E+17

2.36144056252641E+17

2.36143996601262E+17

2.36143853529346E+17

2.36143376632782E+17

2.36142981869101E+17

2.36142262134915E+17

2.36142072980176E+17

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

The graph is directed.

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

The edge colors are based on relationship values. The vertex sizes are based on followers values.

Overall Graph Metrics:

Vertices: 452

Unique Edges: 493

Edges With Duplicates: 360

Total Edges: 853

Self-Loops: 466

Connected Components: 188

Single-Vertex Connected Components: 162

Maximum Vertices in a Connected Component: 225

Maximum Edges in a Connected Component: 489

Maximum Geodesic Distance (Diameter): 11

Average Geodesic Distance: 4.146331

Graph Density: 0.00165806565547554

The graph is directed.

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

Overall Graph Metrics:

Vertices: 4004

Unique Edges: 2944

Edges With Duplicates: 70

Total Edges: 3014

Self-Loops: 0

Connected Components: 1025

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 60

Maximum Edges in a Connected Component: 76

Maximum Geodesic Distance (Diameter): 18

Average Geodesic Distance: 3.910965

Graph Density: 0.000185862101925055

Modularity: Not Applicable

NodeXL Version: 1.0.1.218

Top 10 Vertices, Ranked by Degree:

2.36302620996804E+17

2.36642708146499E+17

2.35564762757484E+17

2.34782349328531E+17

2.35863953027248E+17

2.35576309596692E+17

2.3629590450262E+17

2.3629651822159E+17

2.36595421282201E+17

2.36405167438831E+17

Top 10 Vertices, Ranked by In-Degree:

2.36302620996804E+17

2.36642708146499E+17

2.35564762757484E+17

2.35566145288163E+17

2.35576309596692E+17

2.35863953027248E+17

2.34782349328531E+17

2.36405167438831E+17

2.3629590450262E+17

2.35748491266244E+17

Top 10 Vertices, Ranked by Out-Degree:

2.36143376632782E+17

2.36143271187972E+17

2.36143200996306E+17

2.36143824475394E+17

2.36143557138841E+17

2.36143507113385E+17

2.36143058947829E+17

2.36141730930491E+17

2.36141630481108E+17

2.36141569701474E+17

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

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

Tags: