Matrix: SNAP/ca-HepPh

Description: Collaboration network of Arxiv High Energy Physics

SNAP/ca-HepPh graph
(undirected graph drawing)

scc of SNAP/ca-HepPh

  • 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: 477 KB. Use UFget(2298) or UFget('SNAP/ca-HepPh') in MATLAB.
  • download in Matrix Market format, file size: 391 KB.
  • download in Rutherford/Boeing format, file size: 230 KB.

    Matrix properties
    number of rows12,008
    number of columns12,008
    # strongly connected comp.278
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    Cholesky candidate?no
    positive definite?no

    authorJ. Leskovec, J. Kleinberg and C. Faloutsos
    editorJ. Leskovec
    kindundirected graph
    2D/3D problem?no

    Additional fieldssize and type
    nodenamefull 12008-by-1


    Networks from SNAP (Stanford Network Analysis Platform) Network Data Sets,     
    Jure Leskovec                         
    email jure at                                                  
    High Energy Physics - Phenomenology collaboration network                      
    Dataset information                                                            
    Arxiv HEP-PH (High Energy Physics - Phenomenology) collaboration network is    
    from the e-print arXiv and covers scientific collaborations between authors    
    papers submitted to High Energy Physics - Phenomenology category. If an author 
    i co-authored a paper with author j, the graph contains a undirected edge from 
    i to j. If the paper is co-authored by k authors this generates a completely   
    connected (sub)graph on k nodes.                                               
    The data covers papers in the period from January 1993 to April 2003 (124      
    months). It begins within a few months of the inception of the arXiv, and thus 
    represents essentially the complete history of its HEP-PH section.             
    Dataset statistics                                                             
    Nodes   12008                                                                  
    Edges   237010                                                                 
    Nodes in largest WCC    11204 (0.933)                                          
    Edges in largest WCC    235268 (0.993)                                         
    Nodes in largest SCC    11204 (0.933)                                          
    Edges in largest SCC    235268 (0.993)                                         
    Average clustering coefficient  0.6115                                         
    Number of triangles     3358499                                                
    Fraction of closed triangles    0.6595                                         
    Diameter (longest shortest path)    13                                         
    90-percentile effective diameter    5.8                                        
    Source (citation)                                                              
    J. Leskovec, J. Kleinberg and C. Faloutsos. Graph Evolution: Densification and 
    Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (ACM    
    TKDD), 1(1), 2007.                                                             
    File    Description                                                            
    ca-HepPh.txt.gz     Collaboration network of Arxiv High Energy Physics category

    SVD-based statistics:
    null space dimension645
    full numerical rank?no
    singular value gap6.35017e+09

    singular values (MAT file):click here
    SVD method used:s = svd (full (A)) ;

    SNAP/ca-HepPh svd

    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.