Wikipedia links (be-x-old)

This network consists of the wikilinks of the Wikipedia in the Belarusian (Taraškievica orthography) language (be-x-old). Nodes are Wikipedia articles, and directed edges are wikilinks, i.e., hyperlinks within one wiki. In the wiki source, these are indicated with [[double brackets]]. Only pages in the article namespace are included.

Metadata

CodeWbe-x-old
Internal namewikipedia_link_be_x_old
NameWikipedia links (be-x-old)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =87,179
Volume m =2,549,700
Wedge count s =1,310,802,246
Claw count z =3,070,129,359,092
Triangle count t =34,129,874
Square count q =8,343,147,561
Maximum degree dmax =15,688
Maximum outdegree d+max =825
Maximum indegree dmax =15,133
Average degree d =58.493 4
Fill p =0.000 335 479
Size of LCC N =87,175
Size of LSCC Ns =68,794
Relative size of LSCC Nrs =0.789 112
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.942 29
90-Percentile effective diameter δ0.9 =3.971 75
Median distance δM =3
Mean distance δm =3.479 33
Gini coefficient G =0.706 909
Balanced inequality ratio P =0.231 970
Outdegree balanced inequality ratio P+ =0.252 387
Indegree balanced inequality ratio P =0.200 494
Relative edge distribution entropy Her =0.905 329
Power law exponent γ =1.384 82
Degree assortativity ρ =−0.081 912 6
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.771 833
Clustering coefficient c =0.078 112 2
Directed clustering coefficient c± =0.523 571
Spectral norm α =520.549
Operator 2-norm ν =349.631
Cyclic eigenvalue π =259.017
Spectral separation 1[A] / λ2[A]| =1.011 36
Reciprocity y =0.468 374
Non-bipartivity bA =0.403 226
Normalized non-bipartivity bN =0.131 628
Algebraic non-bipartivity χ =0.206 794
Spectral bipartite frustration bK =0.001 153 98
Controllability C =23,859
Relative controllability Cr =0.273 678

Plots

Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution

SynGraphy

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 ]