Matrix: SNAP/amazon0505

Description: Amazon product co-purchasing network from May 5 2003

SNAP/amazon0505 graph SNAP/amazon0505 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: 8 MB. Use UFget(2306) or UFget('SNAP/amazon0505') in MATLAB.
  • download in Matrix Market format, file size: 11 MB.
  • download in Rutherford/Boeing format, file size: 9 MB.

    Matrix properties
    number of rows410,236
    number of columns410,236
    # strongly connected comp.13,928
    explicit zero entries0
    nonzero pattern symmetry 55%
    numeric value symmetry 55%
    Cholesky candidate?no
    positive definite?no

    authorJ. Leskovec, L. Adamic and B. Adamic
    editorJ. Leskovec
    kinddirected graph
    2D/3D problem?no


    Networks from SNAP (Stanford Network Analysis Platform) Network Data Sets,     
    Jure Leskovec                         
    email jure at                                                  
    Amazon product co-purchasing network, May 05 2003                              
    Dataset information                                                            
    Network was collected by crawling Amazon website. It is based on Customers Who 
    Bought This Item Also Bought feature of the Amazon website. If a product i is  
    frequently co-purchased with product j, the graph contains a directed edge from
    i to j.                                                                        
    The data was collected in May 05 2003.                                         
    Dataset statistics                                                             
    Nodes   410236                                                                 
    Edges   3356824                                                                
    Nodes in largest WCC    410236 (1.000)                                         
    Edges in largest WCC    3356824 (1.000)                                        
    Nodes in largest SCC    390304 (0.951)                                         
    Edges in largest SCC    3255816 (0.970)                                        
    Average clustering coefficient  0.4156                                         
    Number of triangles     3951063                                                
    Fraction of closed triangles    0.1623                                         
    Diameter (longest shortest path)    21                                         
    90-percentile effective diameter    7.6                                        
    Source (citation)                                                              
    J. Leskovec, L. Adamic and B. Adamic. The Dynamics of Viral Marketing. ACM     
    Transactions on the Web (ACM TWEB), 1(1), 2007.                                
    File    Description                                                            
    amazon0505.txt.gz   Amazon product co-purchaisng network from May 05 2003      

    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.