Wikipedia talk (pl)
This is the communication network of the Polish Wikipedia. Nodes represent
users, and an edge from user A to user B denotes that user A wrote a message on
the talk page of user B at a certain timestamp.
Metadata
Statistics
Size  n =  155,820

Volume  m =  1,358,426

Unique edge count  m̿ =  549,603

Loop count  l =  96,591

Wedge count  s =  3,473,856,834

Claw count  z =  56,155,788,572,697

Cross count  x =  753,103,093,235,146,112

Triangle count  t =  2,292,943

Square count  q =  1,928,005,260

4Tour count  T_{4} =  29,320,369,940

Maximum degree  d_{max} =  112,031

Maximum outdegree  d^{+}_{max} =  112,031

Maximum indegree  d^{−}_{max} =  8,726

Average degree  d =  17.435 8

Fill  p =  2.263 62 × 10^{−5}

Average edge multiplicity  m̃ =  2.471 65

Size of LCC  N =  153,167

Size of LSCC  N_{s} =  15,994

Relative size of LSCC  N^{r}_{s} =  0.102 644

Diameter  δ =  7

50Percentile effective diameter  δ_{0.5} =  2.621 82

90Percentile effective diameter  δ_{0.9} =  3.671 64

Median distance  δ_{M} =  3

Mean distance  δ_{m} =  3.127 80

Gini coefficient  G =  0.878 303

Balanced inequality ratio  P =  0.121 534

Outdegree balanced inequality ratio  P_{+} =  0.076 517 2

Indegree balanced inequality ratio  P_{−} =  0.193 785

Relative edge distribution entropy  H_{er} =  0.736 134

Power law exponent  γ =  2.433 03

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

Degree assortativity  ρ =  −0.189 731

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  +0.748 227

Clustering coefficient  c =  0.001 980 17

Directed clustering coefficient  c^{±} =  0.058 978 0

Spectral norm  α =  6,290.51

Operator 2norm  ν =  6,183.55

Cyclic eigenvalue  π =  2,054.81

Algebraic connectivity  a =  0.110 017

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.028 78

Reciprocity  y =  0.331 281

Nonbipartivity  b_{A} =  0.027 970 6

Normalized nonbipartivity  b_{N} =  0.035 164 0

Algebraic nonbipartivity  χ =  0.106 509

Spectral bipartite frustration  b_{K} =  0.004 392 51

Controllability  C =  136,879

Relative controllability  C_{r} =  0.878 443

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]

Jun Sun, Jérôme Kunegis, and Steffen Staab.
Predicting user roles in social networks using transfer learning with
feature transformation.
In Proc. ICDM Workshop on Data Min. in Netw., 2016.
