Stack Overflow
These are interactions from the StackExchange site "Stack Overflow". The
network is between users, and directed edges represent three types of
interactions: answering a question of another user, commenting on another
user's question, and commenting on another user's answer. The network is
temporal. This network is part of a series of network from multiple
StackExchange sites.
Metadata
Statistics
Size  n =  2,601,977

Volume  m =  63,497,050

Unique edge count  m̿ =  36,233,450

Loop count  l =  15,593,784

Wedge count  s =  32,544,604,487

Claw count  z =  233,017,508,108,735

Cross count  x =  1,726,160,310,355,354,368

Triangle count  t =  114,206,974

Maximum degree  d_{max} =  194,806

Maximum outdegree  d^{+}_{max} =  101,663

Maximum indegree  d^{−}_{max} =  93,143

Average degree  d =  48.806 8

Fill  p =  5.351 84 × 10^{−6}

Average edge multiplicity  m̃ =  1.752 44

Size of LCC  N =  2,572,345

Size of LSCC  N_{s} =  1,642,130

Relative size of LSCC  N^{r}_{s} =  0.631 109

Diameter  δ =  11

50Percentile effective diameter  δ_{0.5} =  3.415 07

90Percentile effective diameter  δ_{0.9} =  4.413 11

Median distance  δ_{M} =  4

Mean distance  δ_{m} =  3.912 38

Gini coefficient  G =  0.847 135

Balanced inequality ratio  P =  0.151 529

Outdegree balanced inequality ratio  P_{+} =  0.136 489

Indegree balanced inequality ratio  P_{−} =  0.179 913

Relative edge distribution entropy  H_{er} =  0.868 730

Power law exponent  γ =  1.617 00

Tail power law exponent  γ_{t} =  1.951 00

Degree assortativity  ρ =  −0.066 374 2

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.010 527 7

Directed clustering coefficient  c^{±} =  0.010 757 2

Spectral norm  α =  59,877.4

Operator 2norm  ν =  29,943.5

Cyclic eigenvalue  π =  29,933.2

Reciprocity  y =  0.406 864

Nonbipartivity  b_{A} =  0.998 689

Normalized nonbipartivity  b_{N} =  0.050 881 6

Algebraic nonbipartivity  χ =  0.087 859 8

Spectral bipartite frustration  b_{K} =  0.000 957 115

Plots
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]

Jure Leskovec.
Stanford Network Analysis Project.
http://snap.stanford.edu/, September 2014.
