logo Netzschleuder network catalog, repository, and centrifuge

wikipedia_growth — en-Wikipedia links (2007)

Description

Growth of the network of hyperlinks among the articles of the English Wikipedia, extracted by A. Mislove from the complete edit history of the English Wikipedia as of 6 April 2007. For each link present in the final snapshot, the time when the link was first created was determined from the edit history, which removes the effect of vandalism, where links are temporarily removed and added back. Links to redirect pages were treated as links to the destination of the redirect, with the time of the original link. Links that were removed before the final snapshot are not included. The link creation times range from February 2001 to April 2007.

Nodes are Wikipedia pages and a directed edge $(i,j)$ indicates that page $i$ links to page $j$. The page titles are not included; the nodes are identified only by anonymized IDs.

The network has the following properties:

  • (Node) page_id: the page ID in the source data.
  • (Edge) time: the time when the link was first created, in Unix time.
Tags
Informational Web graph Unweighted Timestamps
Added
2020-08-11
Citation
  • A. Mislove, "Online social networks: measurement, analysis, and applications to distributed information systems." PhD Thesis, Rice University (2009) mislove.org
Upstream URL OK
http://socialnetworks.mpi-sws.org/data-wosn2008.html
Networks
Tip: hover over a column header for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
wikipedia_growth 1,870,709 39,953,145 21.36 366.44 751.67 351.58 -0.04 0.00 10 1.00 Directed Unipartite weight time 132.6 MiB 245.9 MiB 238.2 MiB 226.3 MiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.