Matrix: SNAP/cit-HepTh

Description: Arxiv High Energy Physics paper citation network

SNAP/cit-HepTh graph SNAP/cit-HepTh graph
(bipartite graph drawing) (graph drawing of A+A')


SNAP/cit-HepTh
scc of SNAP/cit-HepTh

  • 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: 823 KB. Use UFget(2293) or UFget('SNAP/cit-HepTh') in MATLAB.
  • download in Matrix Market format, file size: 1 MB.
  • download in Rutherford/Boeing format, file size: 870 KB.

    Matrix properties
    number of rows27,770
    number of columns27,770
    nonzeros352,807
    # strongly connected comp.20,086
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    typebinary
    structureunsymmetric
    Cholesky candidate?no
    positive definite?no

    authorJ. Gehrke, P. Ginsparg, J. Kleinberg
    editorJ. Leskovec
    date2003
    kinddirected graph
    2D/3D problem?no

    Additional fieldssize and type
    nodenamefull 27770-by-1

    Notes:

    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                                                  
                                                                                   
    High-energy physics theory citation network                                    
                                                                                   
    Dataset information                                                            
                                                                                   
    Arxiv HEP-TH (high energy physics theory) citation graph is from the e-print   
    arXiv and covers all the citations within a dataset of 27,770 papers with      
    352,807 edges. If a paper i cites paper j, the graph contains a directed edge  
    from i to j. If a paper cites, or is cited by, a paper outside the dataset, the
    graph does not contain any information about this.                             
                                                                                   
    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-TH section.             
                                                                                   
    The data was originally released as a part of 2003 KDD Cup.                    
                                                                                   
    Dataset statistics                                                             
    Nodes   27770                                                                  
    Edges   352807                                                                 
    Nodes in largest WCC    27400 (0.987)                                          
    Edges in largest WCC    352542 (0.999)                                         
    Nodes in largest SCC    7464 (0.269)                                           
    Edges in largest SCC    116268 (0.330)                                         
    Average clustering coefficient  0.3295                                         
    Number of triangles     1478735                                                
    Fraction of closed triangles    0.1196                                         
    Diameter (longest shortest path)    14                                         
    90-percentile effective diameter    5.4                                        
                                                                                   
    Source (citation)                                                              
                                                                                   
    J. Leskovec, J. Kleinberg and C. Faloutsos. Graphs over Time: Densification    
    Laws, Shrinking Diameters and Possible Explanations. ACM SIGKDD International  
    Conference on Knowledge Discovery and Data Mining (KDD), 2005.                 
                                                                                   
    J. Gehrke, P. Ginsparg, J. M. Kleinberg. Overview of the 2003 KDD Cup. SIGKDD  
    Explorations 5(2): 149-151, 2003.                                              
                                                                                   
    Files                                                                          
    File    Description                                                            
    cit-HepTh.txt.gz    Paper citation network of Arxiv High Energy Physics Theory 
                        category                                                   
    cit-HepTh-dates.txt.gz  Time of nodes (paper submission time to Arxiv)         
    cit-HepTh-abstracts.tar.gz  Paper meta information (see below)                 
                                                                                   
    Example of paper meta information:                                             
                                                                                   
        Paper: hep-th/0002031                                                      
        From: Maulik K. Parikh                                                     
        Date: Fri, 4 Feb 2000 17:04:51 GMT (10kb)                                  
                                                                                   
        Title: Confinement and the AdS/CFT Correspondence                          
        Authors: D. S. Berman and Maulik K. Parikh                                 
        Comments: 12 pages, 1 figure, RevTeX                                       
        Report-no: SPIN-1999/25, UG-1999/42                                        
        Journal-ref: Phys.Lett. B483 (2000) 271-276                                
        \\                                                                         
          We study the thermodynamics of the confined and unconfined phases of     
        superconformal Yang-Mills in finite volume and at large N using the AdS/CFT
        correspondence. We discuss the necessary conditions for a smooth phase     
        crossover and obtain an N-dependent curve for the phase boundary.          
        \\                                                                         
                                                                                   
                                                                                   
                                                                                   
    NOTE: an identical version this problem already appears in the UF Collection:  
                                                                                   
    cit-HepTh           Pajek/HEP-th-new is identical to the                       
                        SNAP/cit-HeptTh graph.  Since it's small, I have           
                        decided to include both in the collection, to              
                        keep the SNAP/ collection complete.                        
                                        n: 27,770    nz:  352,807                  
                                                                                   
    

    SVD-based statistics:
    norm(A)85.1607
    min(svd(A))6.73444e-66
    cond(A)1.26456e+67
    rank(A)21,616
    null space dimension6,154
    full numerical rank?no
    singular value gap3.66194e+08

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

    SNAP/cit-HepTh 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.