Wikipedia links (map-bms)

This network consists of the wikilinks of the Wikipedia in the Basa Banyumasan language (map-bms). 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.


Internal namewikipedia_link_map_bms
NameWikipedia links (map-bms)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =14,136
Volume m =344,911
Loop count l =20
Wedge count s =409,860,537
Claw count z =1,143,301,096,588
Cross count x =2,650,844,078,396,317
Triangle count t =4,436,765
Square count q =1,916,480,257
4-Tour count T4 =16,971,824,304
Maximum degree dmax =10,039
Maximum outdegree d+max =1,912
Maximum indegree dmax =9,887
Average degree d =48.799 0
Fill p =0.001 726 05
Size of LCC N =14,085
Size of LSCC Ns =6,592
Relative size of LSCC Nrs =0.466 327
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.914 54
90-Percentile effective diameter δ0.9 =3.568 32
Median distance δM =2
Mean distance δm =2.679 28
Gini coefficient G =0.657 374
Relative edge distribution entropy Her =0.872 627
Power law exponent γ =1.354 54
Tail power law exponent γt =2.601 00
Degree assortativity ρ =−0.212 999
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.507 268
Clustering coefficient c =0.032 475 2
Directed clustering coefficient c± =0.777 320
Spectral norm α =426.621
Operator 2-norm ν =283.376
Cyclic eigenvalue π =212.031
Algebraic connectivity a =0.084 352 9
Reciprocity y =0.434 031
Non-bipartivity bA =0.379 734
Normalized non-bipartivity bN =0.039 433 2
Spectral bipartite frustration bK =0.000 501 108


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

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution


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 ]