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 passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops


Size n =11,856
Volume m =1,895,125
Loop count l =0
Wedge count s =1,019,567,536
Claw count z =3,277,618,757,585
Cross count x =2,046,496,850,842,817
Triangle count t =329,507,883
Square count q =304,449,712,990
4-Tour count T4 =2,415,165,665,702
Maximum degree dmax =3,409
Maximum outdegree d+max =1,254
Maximum indegree dmax =3,395
Average degree d =319.690
Fill p =0.014 195 8
Size of LCC N =11,856
Size of LSCC Ns =6,407
Relative size of LSCC Nrs =0.571 951
Diameter δ =7
50-Percentile effective diameter δ0.5 =2.562 86
90-Percentile effective diameter δ0.9 =3.693 12
Median distance δM =3
Mean distance δm =3.083 88
Gini coefficient G =0.840 391
Balanced inequality ratio P =0.142 544
Outdegree balanced inequality ratio P+ =0.143 895
Indegree balanced inequality ratio P =0.149 494
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.969 552
Directed clustering coefficient c± =0.997 460
Spectral norm α =2,492.21
Operator 2-norm ν =1,249.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 516
Spectral bipartite frustration bK =0.000 510 801


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 ]