SNAP/ca-GrQc
Collaboration network of Arxiv General Relativity
| Name |
ca-GrQc |
| Group |
SNAP |
| Matrix ID |
2297 |
|
Num Rows
|
5,242 |
|
Num Cols
|
5,242 |
|
Nonzeros
|
28,980 |
|
Pattern Entries
|
28,980 |
|
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
|
355 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
100% |
|
Numeric Symmetry
|
100% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
binary |
| SVD Statistics |
| Matrix Norm |
4.561666e+01 |
| Minimum Singular Value |
0 |
| Condition Number |
Inf
|
| Rank |
4,804 |
| sprank(A)-rank(A) |
|
| Null Space Dimension |
438 |
| 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
General Relativity and Quantum Cosmology collaboration network
Dataset information
Arxiv GR-QC (General Relativity and Quantum Cosmology) collaboration network is
from the e-print arXiv and covers scientific collaborations between authors
papers submitted to General Relativity and Quantum Cosmology 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 GR-QC section.
Dataset statistics
Nodes 5242
Edges 28980
Nodes in largest WCC 4158 (0.793)
Edges in largest WCC 26850 (0.927)
Nodes in largest SCC 4158 (0.793)
Edges in largest SCC 26850 (0.927)
Average clustering coefficient 0.5296
Number of triangles 48260
Fraction of closed triangles 0.6298
Diameter (longest shortest path) 17
90-percentile effective diameter 7.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-GrQc.txt.gz Collaboration network of Arxiv General Relativity category
|
