logo Netzschleuder network catalog, repository, and centrifuge

stanford_web — Webgraph (Stanford)

Description

The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and a directed edge from page A to page B represents a hyperlink in A pointing to B.

Tags
Informational Web graph Unweighted
Added
2021-08-07
Citation
  • J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Mathematics 6(1) 29--123, 2009 arXiv:0810.1355
Upstream URL OK
https://snap.stanford.edu/data/web-Stanford.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
stanford_web 281,904 2,312,497 8.20 167.25 423.82 70233.02 -0.10 0.01 164 0.91 Directed Unipartite 6.7 MiB 14.7 MiB 14.5 MiB 13.8 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.