Wikipedia links (eml)

This network consists of the wikilinks of the Wikipedia in the Emiliano-Romagnolo language (eml). 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_eml
NameWikipedia links (eml)
Data source
AvailabilityDataset is available for download
Consistency checkDataset failed tests: *** No loop found although #loop is set
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 =11,202
Volume m =1,781,203
Loop count l =0
Wedge count s =1,003,821,326
Claw count z =3,240,728,211,989
Cross count x =2,018,097,573,656,646
Triangle count t =325,314,769
Square count q =301,393,564,661
4-Tour count T4 =2,415,165,665,702
Maximum degree dmax =3,153
Maximum outdegree d+max =1,251
Maximum indegree dmax =3,139
Average degree d =318.015
Fill p =0.014 195 8
Size of LCC N =11,202
Size of LSCC Ns =6,407
Relative size of LSCC Nrs =0.571 951
Diameter δ =7
50-Percentile effective diameter δ0.5 =2.491 66
90-Percentile effective diameter δ0.9 =3.599 30
Mean distance δm =2.993 59
Gini coefficient G =0.840 391
Relative edge distribution entropy Her =0.820 731
Power law exponent γ =1.336 62
Tail power law exponent γt =1.471 00
Degree assortativity ρ =+0.721 674
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.858 569
Clustering coefficient c =0.972 229
Directed clustering coefficient c± =0.997 603
Spectral norm α =2,492.21
Operator 2-norm ν =1,246.21
Cyclic eigenvalue π =1,246.00
Algebraic connectivity a =0.338 158
Reciprocity y =0.954 016
Non-bipartivity bA =0.966 967
Normalized non-bipartivity bN =0.210 502
Spectral bipartite frustration bK =0.000 511 941


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 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 ]