Description: Web graph of Stanford.edu
|(bipartite graph drawing)||(graph drawing of A+A')|
|number of rows||281,903|
|number of columns||281,903|
|# strongly connected comp.||29,914|
|explicit zero entries||0|
|nonzero pattern symmetry||28%|
|numeric value symmetry||28%|
Networks from SNAP (Stanford Network Analysis Platform) Network Data Sets, Jure Leskovec http://snap.stanford.edu/data/index.html email jure at cs.stanford.edu Stanford web graph NOTE: see Kamvar/Stanford (matrix ID 979) in the UF Collection Dataset information Nodes represent pages from Stanford University (stanford.edu) and directed edges represent hyperlinks between them. The data was collected in 2002. Dataset statistics Nodes 281903 Edges 2312497 Nodes in largest WCC 255265 (0.906) Edges in largest WCC 2234572 (0.966) Nodes in largest SCC 150532 (0.534) Edges in largest SCC 1576314 (0.682) Average clustering coefficient 0.6109 Number of triangles 11329473 Fraction of closed triangles -0.09686 Diameter (longest shortest path) 740 90-percentile effective diameter 9.8 Source (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. arXiv.org:0810.1355, 2008. Files File Description web-Stanford.txt.gz Stanford web graph from 2002 NOTE: a similar version this problem already appears in the UF Collection: web-Stanford Kamvar/Stanford (same size and nnz) n: 281,903 nz: 2,312,497 The SNAP/web-Stanford graph and the Kamvar/Stanford graphs have the same number of nodes and edges. However, they differ in nonzero pattern.
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.