SNAP/ca-CondMat
Collaboration network of Arxiv Condensed Matter
| Name |
ca-CondMat |
| Group |
SNAP |
| Matrix ID |
2296 |
|
Num Rows
|
23,133 |
|
Num Cols
|
23,133 |
|
Nonzeros
|
186,936 |
|
Pattern Entries
|
186,936 |
|
Kind
|
Undirected Graph |
|
Symmetric
|
Yes |
|
Date
|
2003 |
|
Author
|
J. Leskovec, J. Kleinberg and C. Faloutsos |
|
Editor
|
J. Leskovec |
| Structural Rank |
|
| Structural Rank Full |
|
|
Num Dmperm Blocks
|
|
|
Strongly Connect Components
|
567 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
100% |
|
Numeric Symmetry
|
100% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
binary |
| SVD Statistics |
| Matrix Norm |
3.795411e+01 |
| Minimum Singular Value |
5.520962e-78 |
| Condition Number |
6.874547e+78
|
| Rank |
22,177 |
| sprank(A)-rank(A) |
|
| Null Space Dimension |
956 |
| Full Numerical Rank? |
no |
| Download Singular Values |
MATLAB
|
| Download |
MATLAB
Rutherford Boeing
Matrix Market
|
| 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
Condense Matter collaboration network
Dataset information
Arxiv COND-MAT (Condense Matter Physics) collaboration network is from the
e-print arXiv and covers scientific collaborations between authors papers
submitted to Condense Matter 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 COND-MAT section.
Dataset statistics
Nodes 23133
Edges 186936
Nodes in largest WCC 21363 (0.923)
Edges in largest WCC 182628 (0.977)
Nodes in largest SCC 21363 (0.923)
Edges in largest SCC 182628 (0.977)
Average clustering coefficient 0.6334
Number of triangles 173361
Fraction of closed triangles 0.2643
Diameter (longest shortest path) 15
90-percentile effective diameter 6.6
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.
Files
File Description
ca-CondMat.txt.gz Collaboration network of Arxiv Condensed Matter category
|
