Linux kernel mailing list replies

This is the communication network of the Linux kernel mailing list. Nodes are persons (identified by their email addresses), and each directed edge represents a reply from a user to another.

Metadata

CodeLk
Internal namelkml-reply
NameLinux kernel mailing list replies
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Communication network
Dataset timestamp 2006 ⋯ 2013
Node meaningPerson
Edge meaningReply
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =63,399
Volume m =1,096,440
Unique edge count m̿ =242,976
Loop count l =68,207
Wedge count s =53,774,357
Claw count z =90,935,627,152
Cross count x =71,134,260,805,141
Triangle count t =1,893,021
Square count q =306,703,924
4-Tour count T4 =2,669,048,812
Maximum degree dmax =53,028
Maximum outdegree d+max =28,992
Maximum indegree dmax =28,972
Average degree d =34.588 6
Fill p =0.000 311 541
Average edge multiplicity m̃ =4.512 54
Size of LCC N =24,567
Size of LSCC Ns =18,531
Relative size of LSCC Nrs =0.292 292
Diameter δ =63
50-Percentile effective diameter δ0.5 =4.079 38
90-Percentile effective diameter δ0.9 =7.791 96
Mean distance δm =5.194 81
Gini coefficient G =0.935 172
Balanced inequality ratio P =0.084 688 6
Outdegree balanced inequality ratio P+ =0.089 237 9
Indegree balanced inequality ratio P =0.084 575 5
Relative edge distribution entropy Her =0.798 075
Power law exponent γ =1.869 83
Tail power law exponent γt =1.841 00
Degree assortativity ρ =−0.179 974
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.944 896
Clustering coefficient c =0.105 609
Spectral norm α =11,003.7
Operator 2-norm ν =5,596.49
Cyclic eigenvalue π =5,424.94
Algebraic connectivity a =0.002 282 18
Reciprocity y =0.658 975
Non-bipartivity bA =0.745 741
Normalized non-bipartivity bN =0.001 368 08
Spectral bipartite frustration bK =5.197 43 × 10−5

Plots

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

In/outdegree scatter plot

Edge weight/multiplicity distribution

Clustering coefficient distribution

Average neighbor degree distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

SynGraphy

Inter-event distribution

Node-level inter-event distribution

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] Dirk Homscheid, Jérôme Kunegis, and Mario Schaarschmidt. Private-collective invention and open source software: Longitudinal insights from Linux kernel development. In Proc. IFIP Conf. on e-Business, e-Services and e-Society, pages 299–313, 2015. [ http ]