Wikiversity edits (pt)

This is the bipartite edit network of the Portuguese Wikiversity. It contains users and pages from the Portuguese Wikiversity, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.


Internal nameedit-ptwikiversity
NameWikiversity edits (pt)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Authorship network
Dataset timestamp 2017-10-20
Node meaningUser, article
Edge meaningEdit
Network formatBipartite, undirected
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps


Size n =17,579
Left size n1 =3,292
Right size n2 =14,287
Volume m =77,059
Unique edge count m̿ =29,166
Wedge count s =11,853,165
Claw count z =6,765,916,623
Cross count x =3,382,099,472,486
Square count q =2,879,394
4-Tour count T4 =70,526,328
Maximum degree dmax =4,922
Maximum left degree d1max =4,922
Maximum right degree d2max =1,130
Average degree d =8.767 17
Average left degree d1 =23.408 0
Average right degree d2 =5.393 64
Fill p =0.000 620 120
Average edge multiplicity m̃ =2.642 08
Size of LCC N =15,753
Diameter δ =15
50-Percentile effective diameter δ0.5 =4.017 69
90-Percentile effective diameter δ0.9 =6.681 69
Median distance δM =5
Mean distance δm =4.913 36
Gini coefficient G =0.780 674
Balanced inequality ratio P =0.186 961
Left balanced inequality ratio P1 =0.154 440
Right balanced inequality ratio P2 =0.236 883
Relative edge distribution entropy Her =0.807 801
Power law exponent γ =2.994 37
Tail power law exponent γt =2.691 00
Tail power law exponent with p γ3 =2.691 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.051 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =3.281 00
Right p-value p2 =0.457 000
Degree assortativity ρ =−0.201 536
Degree assortativity p-value pρ =5.952 66 × 10−265
Spectral norm α =1,025.90
Algebraic connectivity a =0.024 016 0
Spectral separation 1[A] / λ2[A]| =2.435 37
Controllability C =11,927
Relative controllability Cr =0.698 057


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

Double Laplacian graph drawing

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Matrix decompositions plots



[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] Wikimedia Foundation. Wikimedia downloads., January 2010.