Matrix: Newman/cond-mat-2003

Description: collaboration network, preprints in condensed matter archive,

Newman/cond-mat-2003 graph
(undirected graph drawing)

scc of Newman/cond-mat-2003

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: Newman
  • Click here for a description of the Newman 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: 1008 KB. Use UFget(2394) or UFget('Newman/cond-mat-2003') in MATLAB.
  • download in Matrix Market format, file size: 684 KB.
  • download in Rutherford/Boeing format, file size: 618 KB.

    Matrix properties
    number of rows31,163
    number of columns31,163
    # strongly connected comp.1,599
    explicit zero entries0
    nonzero pattern symmetrysymmetric
    numeric value symmetrysymmetric
    Cholesky candidate?no
    positive definite?no

    authorM. Newman
    editorM. Newman
    kindundirected weighted graph
    2D/3D problem?no

    Additional fieldssize and type
    nodenamefull 31163-by-25


    Network collection from M. Newman                                                                    
    The graph cond-mat-2003 contains an updated version of cond-mat, the       
    collaboration network of scientists posting preprints on the condensed     
    matter archive at  This version is based on preprints posted
    to the archive between January 1, 1995 and June 30, 2003.  The largest     
    component of this network, which contains 27519 scientists, has been used  
    by several authors as a test-bed for community-finding algorithms for large
    networks; see for example J. Duch and A. Arenas, Phys. Rev. E 72, 027104   
    (2005).  The network is weighted, with weights assigned as described in    
    M. E. J. Newman, Phys. Rev. E 64, 016132 (2001).                           
    These data can be cited as either of:                                      
      M. E. J. Newman, The structure of scientific collaboration networks,     
      Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).  This paper describes the 
      original 1999 version of the network.                                    
      M. E. J. Newman, Fast algorithm for detecting community structure in     
      networks, Phys. Rev. E 69, 066133 (2004).  This paper describes the 2003 

    SVD-based statistics:
    null space dimension2,125
    full numerical rank?no
    singular value gap138380

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

    Newman/cond-mat-2003 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.