Matrix: SNAP/web-Stanford

Description: Web graph of

SNAP/web-Stanford graph SNAP/web-Stanford graph
(bipartite graph drawing) (graph drawing of A+A')


  • Home page of the UF Sparse Matrix Collection
  • Matrix group: SNAP
  • Click here for a description of the SNAP group.
  • Click here for a list of all matrices
  • Click here for a list of all matrix groups
  • download as a MATLAB mat-file, file size: 6 MB. Use UFget(2303) or UFget('SNAP/web-Stanford') in MATLAB.
  • download in Matrix Market format, file size: 9 MB.
  • download in Rutherford/Boeing format, file size: 7 MB.

    Matrix properties
    number of rows281,903
    number of columns281,903
    # strongly connected comp.29,914
    explicit zero entries0
    nonzero pattern symmetry 28%
    numeric value symmetry 28%
    Cholesky candidate?no
    positive definite?no

    authorS. Kamvar
    editorJ. Leskovec
    kinddirected graph
    2D/3D problem?no


    Networks from SNAP (Stanford Network Analysis Platform) Network Data Sets,     
    Jure Leskovec                         
    email jure at                                                  
    Stanford web graph                                                             
    NOTE:  see Kamvar/Stanford (matrix ID 979) in the UF Collection                
    Dataset information                                                            
    Nodes represent pages from Stanford University ( 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., 2008.                                                     
    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.