google_web — Old Google web graph (2002)

Description: A web graph released by Google in 2002 as part of the Google Programming Contest, as distributed by the Stanford Network Analysis Project (SNAP). Nodes are web pages and a directed edge $(i, j)$ is a hyperlink from page $i$ to page $j$. The URLs of the pages are not included. The vertex property name holds the node ID of the source data.

Tags

Informational Web graph Unweighted

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-Google.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
google_web	916,428	5,105,039	5.57	39.82	101.24	3384.37	-0.05	0.09	24	0.93	Directed	Unipartite			21.5 MiB	39.6 MiB	39.6 MiB	38.9 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.