Wikiquote edits (hu)

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


Internal nameedit-huwikisource
NameWikiquote edits (hu)
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 =36,229
Left size n1 =481
Right size n2 =35,748
Volume m =82,236
Unique edge count m̿ =54,617
Wedge count s =295,465,417
Claw count z =1,592,257,684,539
Cross count x =7,088,669,024,850,621
Square count q =47,974,185
4-Tour count T4 =1,565,772,010
Maximum degree dmax =29,244
Maximum left degree d1max =29,244
Maximum right degree d2max =592
Average degree d =4.539 79
Average left degree d1 =170.969
Average right degree d2 =2.300 44
Fill p =0.003 176 37
Average edge multiplicity m̃ =1.505 69
Size of LCC N =35,756
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.272 82
90-Percentile effective diameter δ0.9 =5.039 69
Median distance δM =4
Mean distance δm =3.551 76
Gini coefficient G =0.710 930
Balanced inequality ratio P =0.229 285
Left balanced inequality ratio P1 =0.046 184 2
Right balanced inequality ratio P2 =0.354 054
Relative edge distribution entropy Her =0.670 367
Power law exponent γ =3.896 61
Tail power law exponent γt =4.851 00
Degree assortativity ρ =−0.156 613
Degree assortativity p-value pρ =6.673 21 × 10−297
Spectral norm α =876.717
Controllability C =35,173
Relative controllability Cr =0.975 213


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

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.