Wikipedia talk (bn)

This is the communication network of the Bangla Wikipedia. Nodes represent users, and an edge from user A to user B denotes that user A wrote a message on the talk page of user B at a certain timestamp.

Metadata

CodeTbn
Internal namewiki_talk_bn
NameWikipedia talk (bn)
Data sourcehttps://zenodo.org/record/49561
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Communication network
Dataset timestamp 2017-10-27
Node meaningUser
Edge meaningMessage
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =83,803
Volume m =122,078
Unique edge count m̿ =99,789
Wedge count s =607,190,714
Triangle count t =14,552
Maximum degree dmax =21,778
Maximum outdegree d+max =21,746
Maximum indegree dmax =1,440
Average degree d =2.913 45
Size of LCC N =83,521
Diameter δ =7
50-Percentile effective diameter δ0.5 =3.286 95
90-Percentile effective diameter δ0.9 =4.085 39
Median distance δM =4
Mean distance δm =3.617 18
Degree assortativity ρ =−0.510 017
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.566 989
Clustering coefficient c =7.189 83 × 10−5
Operator 2-norm ν =640.447
Cyclic eigenvalue π =616.099
Reciprocity y =0.037 529 2

Plots

Degree distribution

Cumulative degree distribution

Temporal distribution

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 ]
[2] Jun Sun, Jérôme Kunegis, and Steffen Staab. Predicting user roles in social networks using transfer learning with feature transformation. In Proc. ICDM Workshop on Data Min. in Netw., 2016.