Newman/cond-mat-2003

collaboration network, preprints in condensed matter archive, www.arxiv.org
Name cond-mat-2003
Group Newman
Matrix ID 2394
Num Rows 31,163
Num Cols 31,163
Nonzeros 240,058
Pattern Entries 240,058
Kind Undirected Weighted Graph
Symmetric Yes
Date 2003
Author M. Newman
Editor M. Newman
Structural Rank
Structural Rank Full
Num Dmperm Blocks
Strongly Connect Components 1,599
Num Explicit Zeros 0
Pattern Symmetry 100%
Numeric Symmetry 100%
Cholesky Candidate no
Positive Definite no
Type real
SVD Statistics
Matrix Norm 3.851784e+01
Minimum Singular Value 6.002547e-34
Condition Number 6.416916e+34
Rank 29,038
sprank(A)-rank(A)
Null Space Dimension 2,125
Full Numerical Rank? no
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
Notes
Network collection from M. Newman                                          
http://www-personal.umich.edu/~mejn/netdata/                               
                                                                           
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 www.arxiv.org.  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 
  version.