Github

This is the membership network of the software development hosting site GitHub. The network is bipartite and contains users and projects, with links denoting that a user is a member of a project.

Metadata

Code		`GH`
Internal name		`github`
Name		Github
Data source		https://github.com/blog/466-the-2009-github-contest
Availability		Dataset is available for download
Consistency check		Dataset passed all tests
Category		Authorship network
Node meaning		User, project
Edge meaning		Membership
Network format		Bipartite, undirected
Edge type		Unweighted, no multiple edges

Statistics

Size	n =	177,386
Left size	n₁ =	56,519
Right size	n₂ =	120,867
Volume	m =	440,237
Wedge count	s =	53,048,506
Claw count	z =	17,233,019,660
Cross count	x =	9,927,710,269,155
Square count	q =	50,894,505
4-Tour count	T₄ =	620,327,470
Maximum degree	d_max =	3,675
Maximum left degree	d_1max =	884
Maximum right degree	d_2max =	3,675
Average degree	d =	4.963 60
Average left degree	d₁ =	7.789 19
Average right degree	d₂ =	3.642 33
Fill	p =	6.444 43 × 10⁻⁵
Size of LCC	N =	139,737
Diameter	δ =	22
50-Percentile effective diameter	δ_0.5 =	4.860 62
90-Percentile effective diameter	δ_0.9 =	6.516 22
Median distance	δ_M =	5
Mean distance	δ_m =	5.353 42
Gini coefficient	G =	0.744 516
Balanced inequality ratio	P =	0.199 248
Left balanced inequality ratio	P₁ =	0.205 260
Right balanced inequality ratio	P₂ =	0.231 457
Relative edge distribution entropy	H_er =	0.873 618
Power law exponent	γ =	2.612 40
Tail power law exponent	γ_t =	1.951 00
Tail power law exponent with p	γ₃ =	1.951 00
p-value	p =	0.000 00
Left tail power law exponent with p	γ_3,1 =	2.721 00
Left p-value	p₁ =	0.011 000 0
Right tail power law exponent with p	γ_3,2 =	2.041 00
Right p-value	p₂ =	0.001 000 00
Degree assortativity	ρ =	−0.035 776 7
Degree assortativity p-value	p_ρ =	1.223 26 × 10⁻¹²⁴
Spectral norm	α =	120.273
Algebraic connectivity	a =	0.010 203 8
Spectral separation	\|λ₁[A] / λ₂[A]\| =	2.027 71
Controllability	C =	78,745
Relative controllability	C_r =	0.443 919

Plots

Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Delaunay graph drawing

Matrix decompositions plots

Downloads

References

[1]	Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]
[2]	Scott Chacon. The 2009 GitHub contest. https://github.com/blog/466-the-2009-github-contest, July 2009.